Pebbling in dense graphs

@article{Czygrinow2003PebblingID,
  title={Pebbling in dense graphs},
  author={Andrzej Czygrinow and Glenn H. Hurlbert},
  journal={Australasian J. Combinatorics},
  year={2003},
  volume={28},
  pages={201-208}
}
A configuration of pebbles on the vertices of a graph is solvable if one can place a pebble on any given root vertex via a sequence of pebbling steps. The pebbling number of a graph G is the minimum number π(G) so that every configuration of π(G) pebbles is solvable. A graph is Class 0 if its pebbling number equals its number of vertices. A function is a pebbling threshold for a sequence of graphs if a randomly chosen configuration of asymptotically more pebbles is almost surely solvable, while… CONTINUE READING

From This Paper

Topics from this paper.
3 Citations
12 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 12 references

On a conjecture about pebbling thresholds

  • A. Czygrinow, M. Wagner
  • preprint
  • 2002
1 Excerpt

On pebbling graphs

  • L. Pachter, H. S. Snevily, B. Voxman
  • Congr. Numer. 107 (1995), 65–80.
  • 2002
1 Excerpt

On pebbling graphs , Congress

  • H. S. Snevily L. Pachter
  • Congress . Numer .
  • 1999

Two pebbling theorems

  • G. Hurlbert
  • Congr. Numer. 135
  • 1998
1 Excerpt

Similar Papers

Loading similar papers…