✦ LIBER ✦

The Complexity of Pebbling in Diameter Two Graphs

✍ Scribed by Cusack, Charles A.; Lewis, Timothy; Simpson, Daniel; Taggart, Samuel

Book ID: 118197971
Publisher: Society for Industrial and Applied Mathematics
Year: 2012
Tongue: English
Weight: 210 KB
Volume: 26
Category: Article
ISSN: 0895-4801
DOI: 10.1137/11084412x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Pebbling Algorithms in Diameter Two Grap

Pebbling Algorithms in Diameter Two Graphs

✍ Bekmetjev, Airat; Cusack, Charles A. 📂 Article 📅 2009 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 256 KB

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

Pebbling Graphs of Diameter Three and Fo

Pebbling Graphs of Diameter Three and Four

✍ Luke Postle; Noah Streib; Carl Yerger 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 692 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 Complexity of Graph Pebbling

✍ Milans, Kevin; Clark, Bryan 📂 Article 📅 2006 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 343 KB

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