Graham's pebbling conjecture holds for the product of a graph and a sufficiently large complete bipartite graph

@article{Pleanmani2019GrahamsPC,
  title={Graham's pebbling conjecture holds for the product of a graph and a sufficiently large complete bipartite graph},
  author={Nopparat Pleanmani},
  journal={Discret. Math. Algorithms Appl.},
  year={2019},
  volume={11},
  pages={1950068:1-1950068:7}
}
A graph pebbling is a network optimization model for the transmission of consumable resources. A pebbling move on a connected graph G is the process of removing two pebbles from a vertex and placin... 
View via Publisher
doi.org

References

SHOWING 1-4 OF 4 REFERENCES
Graham’s pebbling conjecture on product of complete bipartite graphs
The pebbling number of a graph G, f(G), is the least n such that, no matter how n pebbles are placed on the vertices of G, we can move a pebble to any vertex by a sequence of moves, each move taking…
Pebbling and Graham's Conjecture
The proof of a conjecture due to Snevily
Pebbling in hypercubes
This paper considers the following game on a hypercube, first suggested by Lagarias and Saks. Suppose $2^n$ pebbles are distributed onto vertices of an n-cube (with $2^n$ vertices). A pebbling step…