✦ LIBER ✦

Pebbling Graphs of Diameter Three and Four

✍ Scribed by Luke Postle; Noah Streib; Carl Yerger

Book ID: 112121114
Publisher: John Wiley and Sons
Year: 2012
Tongue: English
Weight: 692 KB
Volume: 72
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.21648

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 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

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

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

DDR Graphs of Diameter Three

✍ Medha Huilgol; H.B. Walikar; B.D. Acharya 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 71 KB

Antipodal graphs of diameter three

✍ A. Gardiner 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 290 KB