The cover pebbling number of graphs

DOI10.1016/J.DISC.2005.03.009zbMATH Open1066.05140DBLPjournals/dm/CrullCFHPST05arXivmath/0406206OpenAlexW2120327434WikidataQ30053617 ScholiaQ30053617MaRDI QIDQ2484366FDOQ2484366

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

Publication date: 1 August 2005

Published in: Discrete Mathematics (Search for Journal in Brave)

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.

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

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

zbMATH Keywords

Coverable

Mathematics Subject Classification ID

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

Cites Work

• Pebbling in Hypercubes
• Pebbling graphs
• Title not available (Why is that?)
• Graham's pebbling conjecture on products of cycles
• The cover pebbling theorem
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (21)

• Cover Pebbling Thresholds for the Complete Graph
• The pebbling threshold of the square of cliques
• Maximal matching cover pebbling number for variants of hypercube
• Domination cover rubbling
• NDC pebbling number for some class of graphs
• Total domination cover rubbling
• Cover rubbling and stacking
• Generalizations of Graham's pebbling conjecture
• Title not available (Why is that?)
• The cover pebbling theorem
• On the target pebbling conjecture
• Rubbling and optimal rubbling of graphs
• The \(t\)-pebbling number of graphs
• Threshold and complexity results for the cover pebbling game
• On the secure vertex cover pebbling number
• Graph pebbling algorithms and Lemke graphs
• Title not available (Why is that?)
• Pebbling in powers of paths
• SECURE DOMINATION COVER PEBBLING NUMBER FOR VARIANTS OF COMPLETE GRAPHS
• General graph pebbling
• Optimal pebbling number of the square grid

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)