The cover pebbling number of graphs

DOI10.1016/J.DISC.2005.03.009MaRDI QIDQ2484366zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Betsy Crull, Tammy Cundiff, Paul Feltman, Lara Pudwell, Zsuzsanna Szaniszló, Zsolt Tuza, Glenn H. Hurlbert

Publication date 1 August 2005

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Coverable

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Graph theory (05C99)

Abstract: A pebbling move on a graph consists of taking two pebbles off of one vertex and placing one pebble on an adjacent vertex. In the traditional pebbling problem we try to reach a specified vertex of the graph by a sequence of pebbling moves. In this paper we investigate the case when every vertex of the graph must end up with at least one pebble after a series of pebbling moves. The cover pebbling number of a graph is the minimum number of pebbles such that however the pebbles are initially placed on the vertices of the graph we can eventually put a pebble on every vertex simultaneously. We find the cover pebbling numbers of trees and some other graphs. We also consider the more general problem where (possibly different) given numbers of pebbles are required for the vertices.

Recommendations

• Cover pebbling number of some product graphs
• The cover pebbling theorem
• Cover pebbling numbers and bounds for certain families of graphs
• Cover pebbling number for square of a path
• Cover pebbling hypercubes

Cites work

• Cover pebbling hypercubes
• Cover pebbling numbers and bounds for certain families of graphs
• Graham's pebbling conjecture on products of cycles
• scientific article; zbMATH DE number 1439473 (Why is no real title available?)
• Pebbling graphs
• Pebbling in Hypercubes
• The cover pebbling theorem

Cited in

(36)

• Threshold and complexity results for the cover pebbling game
• Rubbling and optimal rubbling of graphs
• Domination cover rubbling
• On properties of pebble assignment graphs
• Optimal pebbling number of the square grid
• Total domination cover rubbling
• Cover rubbling and stacking
• Graph pebbling algorithms and Lemke graphs
• The t-pebbling number of graphs
• The cover pebbling theorem
• Pebbling in powers of paths
• Covering cover pebbling number for square of a path
• Covering cover pebbling number of a hyperbube \& diameter d graphs
• Cover pebbling number of some product graphs
• Cover pebbling numbers and bounds for certain families of graphs
• Cover Pebbling Thresholds for the Complete Graph
• Domination cover pebbling: graph families
• General graph pebbling
• scientific article; zbMATH DE number 1040545 (Why is no real title available?)
• scientific article; zbMATH DE number 1941839 (Why is no real title available?)
• Generalizations of Graham's pebbling conjecture
• An explicit solution to the chessboard pebbling problem
• Cover pebbling number for square of a path
• Covering cover pebbling number for square of a cycle
• SECURE DOMINATION COVER PEBBLING NUMBER FOR VARIANTS OF COMPLETE GRAPHS
• Cover pebbling hypercubes
• Maximal matching cover pebbling number for variants of hypercube
• NDC pebbling number for some class of graphs
• On the target pebbling conjecture
• Hub cover pebbling number.
• On the secure vertex cover pebbling number
• Target pebbling in trees
• 2-target t-pebbling number of path-derived graphs
• 2-target pebbling number of graphs
• Monophonic cover pebbling number (MCPN) of network graphs
• The pebbling threshold of the square of cliques

This page was built for publication: The cover pebbling number of graphs

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