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

The -pebbling number of

โœ Scribed by Gao, Ze-Tu; Yin, Jian-Hua


Book ID
121267203
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
459 KB
Volume
313
Category
Article
ISSN
0012-365X

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

Pebbling number of squares of odd cycles
โœ Yongsheng Ye; Mingqing Zhai; Yun Zhang ๐Ÿ“‚ Article ๐Ÿ“… 2012 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 202 KB
Maximum pebbling number of graphs of dia
โœ 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