๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Pebbling Algorithms in Diameter Two Graphs

โœ Scribed by Bekmetjev, Airat; Cusack, Charles A.

Book ID
118197038
Publisher
Society for Industrial and Applied Mathematics
Year
2009
Tongue
English
Weight
256 KB
Volume
23
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

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

Pebbling and optimal pebbling in graphs
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