The cover pebbling theorem

zbMATH Open1081.05048arXivmath/0410129MaRDI QIDQ2583674FDOQ2583674

Authors: Jonas Sjöstrand 

Publication date: 17 January 2006

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: For any configuration of pebbles on the nodes of a graph, a pebbling move replaces two pebbles on one node by one pebble on an adjacent node. A cover pebbling is a move sequence ending with no empty nodes. The number of pebbles needed for a cover pebbling starting with all pebbles on one node is trivial to compute and it was conjectured that the maximum of these simple cover pebbling numbers is indeed the general cover pebbling number of the graph. That is, for any configuration of this size, there exists a cover pebbling. In this note, we prove a generalization of the conjecture. All previously published results about cover pebbling numbers for special graphs (trees, hypercubes etcetera) are direct consequences of this theorem. We also prove that the cover pebbling number of a product of two graphs equals the product of the cover pebbling numbers of the graphs.

Full work available at URL: https://arxiv.org/abs/math/0410129

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

Recommendations

• The cover pebbling number of graphs
• Cover pebbling numbers and bounds for certain families of graphs
• Weighted pebbling numbers on graphs
• Cover rubbling and stacking
• Generalizations of Graham's pebbling conjecture
• Domination cover pebbling: graph families
• A Graph Pebbling Algorithm on Weighted Graphs
• Threshold and complexity results for the cover pebbling game
• Cover pebbling hypercubes
• Cover pebbling number for square of a path

zbMATH Keywords

Pebbling coverWeighted pebbling cover

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Games involving graphs (91A43)

Cited In (12)

• Domination cover rubbling
• Cover pebbling hypercubes
• Cover rubbling and stacking
• Generalizations of Graham's pebbling conjecture
• The cover pebbling number of graphs
• On the target pebbling conjecture
• Rubbling and optimal rubbling of graphs
• Threshold and complexity results for the cover pebbling game
• Pebble minimization: the last theorems
• Pebbling in powers of paths
• The PSPACE-Completeness of Black-White Pebbling
• General graph pebbling

This page was built for publication: The cover pebbling theorem

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