Pebbling in Split Graphs

Graph pebbling is a network optimization model for transporting discrete resources that are consumed in transit: the movement of 2 pebbles across an edge consumes one of the pebbles. The pebbling number of a graph is the fewest number of pebbles $t$ so that, from any initial configuration of $t$ pebbles on its vertices, one can place a pebble on any given target vertex via such pebbling steps. It is known that deciding whether a given configuration on a particular graph can reach a specified target is \sf NP-complete, even for diameter $2$ graphs, and that deciding whether the pebbling number has a prescribed upper bound is $\Pi_2^{\sf P}$-complete. On the other hand, for many families of graphs there are formulas or polynomial algorithms for computing pebbling numbers; for example, complete graphs, products of paths (including cubes), trees, cycles, diameter $2$ graphs, and more. Moreover, graphs having minimum pebbling number are called Class 0, and many authors have studied which graphs are Class 0 and...

[1]  Glenn H. Hurlbert,et al.  General graph pebbling , 2013, Discret. Appl. Math..

[2]  Andrzej Czygrinow,et al.  A Note on Graph Pebbling , 2002, Graphs Comb..

[3]  John Schmitt,et al.  Degree sum conditions in graph pebbling , 2008, Australas. J Comb..

[4]  Saharon Shelah,et al.  On finite rigid structures , 1994, Journal of Symbolic Logic.

[5]  Robert E. Tarjan,et al.  The Pebbling Problem is Complete in Polynomial Space , 1980, SIAM J. Comput..

[6]  Noga Alon,et al.  Finding and counting given length cycles , 1997, Algorithmica.

[7]  Glenn Hurlbert.  Recent Progress in Graph Pebbling , 2005 .

[8]  Ileana Streinu,et al.  Sparse Hypergraphs and Pebble Game Algorithms , 2007, Eur. J. Comb..

[9]  Charles A. Cusack,et al.  Pebbling Algorithms in Diameter Two Graphs , 2009, SIAM J. Discret. Math..

[10]  G. Hurlbert,et al.  On Pebbling Graphs by Their Blocks , 2008, 0811.3238.

[11]  D. West.  Introduction to Graph Theory , 1995 .

[12]  Glenn H. Hurlbert,et al.  An application of graph pebbling to zero-sum sequences in abelian groups , 2004 .

[13]  Andrzej Czygrinow,et al.  Girth, Pebbling, and Grid Thresholds , 2006, SIAM J. Discret. Math..

[14]  T. D. Parsons,et al.  Pursuit-evasion in a graph , 1978 .

[15]  Kevin G. Milans,et al.  The Complexity of Graph Pebbling , 2006, SIAM J. Discret. Math..

[16]  Christos H. Papadimitriou,et al.  Searching and Pebbling , 1986, Theor. Comput. Sci..

[17]  Glenn H. Hurlbert,et al.  t-Pebbling and Extensions , 2013, Graphs Comb..

[18]  Ravi Sethi,et al.  Complete register allocation problems , 1973, SIAM J. Comput..

[19]  W. H. Liu,et al.  AN APPLICATION OF GENERALIZED TREE PEBBLING TO SPARSE MATRIX FACTORIZATION , 2022 .

[20]  Glenn Hurlbert.  A linear optimization technique for graph pebbling , 2010 .

[21]  Daniel Simpson,et al.  The Complexity of Pebbling in Diameter Two Graphs , 2012, SIAM J. Discret. Math..

[22]  Leslie G. Valiant,et al.  On Time Versus Space , 1977, JACM.

[23]  Carl Hewitt,et al.  Comparative Schematology , 1970 .

[24]  Lior Pachter,et al.  On pebbling graphs , 1995 .

[25]  Fan Chung.  Pebbling in hypercubes , 1989 .

[26]  Michael P. Knapp.  2-Adic zeros of diagonal forms and distance pebbling of graphs , 2014 .

[27]  Maria Klawe.  The complexity of pebbling for two classes of graphs , 1985 .

[28]  Glenn H. Hurlbert,et al.  Pebbling in diameter two graphs and products of paths , 1997, J. Graph Theory.