Visitar URL original
2-Pebbling Property -- from Wolfram MathWorld
TOPICS
Search

2-Pebbling Property

A graph G has the 2-pebbling property if, for any distribution of more than 2pi(G)-q pebbles on G, where pi(G) is the pebbling number and q is the number of vertices receiving at least one pebble in the distribution, it is possible to move two pebbles to any specified target vertex using pebbling moves.

The 2-pebbling property is a strengthening related to graph pebbling and the pebbling number. The Lemke graph is the smallest graph that does not have the 2-pebbling property (Hurlbert 2013).

See also

Graph Pebbling, Lemke Graph, Pebbling Move, Pebbling Number

Explore with Wolfram|Alpha

References

Hurlbert, G. "General Graph Pebbling." Disc. Appl. Math. 161, 1221-1231, 2013.

Cite this as:

Weisstein, Eric W. "2-Pebbling Property." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/2-PebblingProperty.html

Subject classifications