✦ LIBER ✦

Pebbling graphs

✍ Scribed by David Moews

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 463 KB
Volume: 55
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(92)90043-w

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Pebbling and optimal pebbling in graphs

✍ David P. Bunde; Erin W. Chambers; Daniel Cranston; Kevin Milans; Douglas B. West 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 248 KB

## Abstract Given a distribution of pebbles on the vertices of a graph __G__, a __pebbling move__ takes two pebbles from one vertex and puts one on a neighboring vertex. The __pebbling number__ Π(__G__) is the least __k__ such that for every distribution of __k__ pebbles and every vertex __r__, a p

Maximum pebbling number of graphs of dia

Maximum pebbling number of graphs of diameter three

✍ Boris Bukh 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 93 KB 👁 1 views

## Abstract Given a configuration of pebbles on the vertices of a graph __G__, a __pebbling move__ consists of taking two pebbles off some vertex __v__ and putting one of them back on a vertex adjacent to __v__. A graph is called __pebbleable__ if for each vertex __v__ there is a sequence of pebbli

Pebbling in diameter two graphs and prod

Pebbling in diameter two graphs and products of paths

✍ Clarke, T. A.; Hochberg, R. A.; Hurlbert, G. H. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB 👁 1 views

Results regarding the pebbling number of various graphs are presented. We say a graph is of Class 0 if its pebbling number equals the number of its vertices. For diameter d we conjecture that every graph of sufficient connectivity is of Class 0. We verify the conjecture for d = 2 by characterizing t

Searching and pebbling

✍ Lefteris M. Kirousis; Christos H. Papadimitriou 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 937 KB

A comparison of two variations of a pebb

A comparison of two variations of a pebble game on graphs

✍ Friedhelm Meyer auf der Heide 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 347 KB

The number of pebbles used in the black [black-white] pebble game corresponds to the storage requirement of the deterministic [non-deterministic] evaluation of a straight line program. Suppose a distinguished vertex of a directed acyclic graph can be pebbled with k pebbles in the black-white pebble

Geometrical optics and chessboard pebbli

Geometrical optics and chessboard pebbling

✍ C. Knessl 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 461 KB

## Recently Chung. Graham, Morrison and Odlyzko [l] studied some combinatorial and asymptotic enumeration aspects of chessboard pebbling. In this problem, we start with a single pebble, placed at the origin (0,O) of an infinite chessboard. At each step we remove a pebble from (i,j) and repIace i