Graph pebbling
Graph pebbling is a mathematical game played on a graph with zero or more pebbles on each of its vertices.
≈ 4 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
Graph pebbling is a mathematical game played on a graph with zero or more pebbles on each of its vertices. 'Game play' is composed of a series of pebbling moves.
A pebbling move on a graph consists of choosing a vertex with at least two pebbles, removing two pebbles from it, and adding one to an adjacent vertex (the second removed pebble is discarded from play). π(G), the pebbling number of a graph G, is the lowest natural number n that satisfies the following condition: Given any target or 'root' vertex in the graph and any initial configuration of n pebbles on the graph, it is possible, after a possibly-empty series of pebbling moves, to reach a new configuration in which the designated root vertex has one or more pebbles. For example, on a graph with 2 vertices and 1 edge connecting them, the pebbling number is 2.
No matter how the two pebbles are placed on the vertices of the graph it is always possible to arrive at the desired result of the chosen vertex having a pebble; if the initial configuration is the configuration with one pebble per vertex, then the objective is trivially accomplished with zero pebbling moves. One of the central questions of graph pebbling is the value of π(G) for a given graph G. Other topics in pebbling include cover pebbling, optimal pebbling, domination cover pebbling, bounds, and thresholds for pebbling numbers, as well as deep graphs.…
Graph pebbling is a mathematical game played on a graph with zero or more pebbles on each of its vertices. 'Game play' is composed of a series of pebbling moves.
A pebbling move on a graph consists of choosing a vertex with at least two pebbles, removing two pebbles from it, and adding one to an adjacent vertex (the second removed pebble is discarded from play). π(G), the pebbling number of a graph G, is the lowest natural number n that satisfies the following condition: Given any target or 'root' vertex in the graph and any initial configuration of n pebbles on the graph, it is possible, after a possibly-empty series of pebbling moves, to reach a new configuration in which the designated root vertex has one or more pebbles. For example, on a graph with 2 vertices and 1 edge connecting them, the pebbling number is 2.
No matter how the two pebbles are placed on the vertices of the graph it is always possible to arrive at the desired result of the chosen vertex having a pebble; if the initial configuration is the configuration with one pebble per vertex, then the objective is trivially accomplished with zero pebbling moves. One of the central questions of graph pebbling is the value of π(G) for a given graph G. Other topics in pebbling include cover pebbling, optimal pebbling, domination cover pebbling, bounds, and thresholds for pebbling numbers, as well as deep graphs.
One application of pebbling games is in the security analysis of memory-hard functions in cryptography. \pi(K_n) = n , where K_n is a complete graph on n vertices. \pi(P_n) = 2^{n-1} , where P_n is a path graph on n vertices. \pi(W_n) = n , where W_n is a wheel graph on n vertices. s(v) = \sum_{u \in V(G)} 2^{d(u,v)} for every vertex v in G, where d(u,v) denotes the distance from u to v. Then the cover pebbling number is the largest s(v) that results. \gamma(K_n) = 2n - 1 , where K_n is a complete graph on n vertices. \gamma(P_n) = 2^n - 1 , where P_n is a path graph on n vertices. \gamma (W_n) = 4n - 9 , where W_n is a wheel graph on n vertices.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1329363560 under CC BY-SA 4.0; modifications have been made.