On Pebbling Graphs by Their Blocks

DOI10.1515/INTEG.2009.033MaRDI QIDQ3182875zbMATH OpenFDO

Authors Dawn Curtis, Taylor Hines, Tatiana Moyer, Glenn H. Hurlbert

Publication date 16 October 2009

Published in Integers (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0811.3238, https://eudml.org/doc/130552

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

block-cutpoint graphdiameter two graphsmaximal path partitionpebbling number

Mathematics Subject Classification ID

Distance in graphs (05C12) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)

Abstract: Graph pebbling is a game played on a connected graph G. A player purchases pebbles at a dollar a piece, and hands them to an adversary who distributes them among the vertices of G (called a configuration) and chooses a target vertex r. The player may make a pebbling move by taking two pebbles off of one vertex and moving one pebble to a neighboring vertex. The player wins the game if he can move k pebbles to r. The value of the game (G,k), called the k-pebbling number of G, is the minimum cost to the player to guarantee a win. That is, it is the smallest positive integer m of pebbles so that, from every configuration of size m, one can move k pebbles to any target. In this paper, we use the block structure of graphs to investigate pebbling numbers, and we present the exact pebbling number of the graphs whose blocks are complete. We also provide an upper bound for the k-pebbling number of diameter-two graphs, which can be the basis for further investigation into the pebbling numbers of graphs with blocks that have diameter at most two.

Recommendations

• Two-player pebbling on diameter 2 graphs
• Pebbling graphs of diameter three and four
• Pebbling graphs of diameter three and four
• Maximum pebbling number of graphs of diameter three
• t-pebbling and extensions

Cited in

(12)

• Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid
• Two-player pebbling on diameter 2 graphs
• Pebbling in Split Graphs
• The game of blocking pebbles
• t-pebbling and extensions
• General graph pebbling
• Characterizing winning positions in the impartial two-player pebbling game on complete graphs
• The game of blocking pebbles
• Pebbling graphs of fixed diameter
• Optimal t-rubbling on complete graphs and paths
• Generalized impartial two-player pebbling games on K₃ and C₄
• On the pebbling numbers of flower, Blanuša and Watkins snarks

This page was built for publication: On Pebbling Graphs by Their Blocks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3182875)