✦ LIBER ✦

On the -pebbling number and the -pebbling property of graphs

✍ Scribed by Gao, Ze-Tu; Yin, Jian-Hua

Book ID: 122344716
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 389 KB
Volume: 161
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2012.12.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The cover pebbling number of graphs

✍ Betsy Crull; Tammy Cundiff; Paul Feltman; Glenn H. Hurlbert; Lara Pudwell; Zsuzs 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 184 KB

The 2-pebbling property for dense graphs

✍ Gao, Ze Tu; Yin, Jian Hua 📂 Article 📅 2012 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 257 KB

The -pebbling number of

✍ Gao, Ze-Tu; Yin, Jian-Hua 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 459 KB

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

The pebbling number of C5 × C5

✍ David S. Herscovici; Aparna W. Higgins 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 519 KB

Chung has defined a pebbling move on a graph G to be the removal of two pebbles from one vertex and the addition of one pebble to an adjacent vertex. The pebbling number f(G) of a connected graph is the least number of pebbles such that any distribution of f(G) pebbles on G allows one pebble to be m

The Complexity of Pebbling in Diameter T

The Complexity of Pebbling in Diameter Two Graphs

✍ Cusack, Charles A.; Lewis, Timothy; Simpson, Daniel; Taggart, Samuel 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 210 KB