Bounds on the rubbling and optimal rubbling numbers of graphs

DOI10.1007/S00373-012-1146-2MaRDI QIDQ2376084zbMATH OpenOpenAlexFDO

Authors Gyula Y. Katona, Nándor Sieben

Publication date 26 June 2013

Published in Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

pebblingrubbling

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph theory (05C99)

Abstract: A pebbling move on a graph removes two pebbles at a vertex and adds one pebble at an adjacent vertex. Rubbling is a version of pebbling where an additional move is allowed. In this new move, one pebble each is removed at vertices $v$ and $w$ adjacent to a vertex $u$, and an extra pebble is added at vertex $u$. A vertex is reachable from a pebble distribution if it is possible to move a pebble to that vertex using rubbling moves. The rubbling number is the smallest number $m$ needed to guarantee that any vertex is reachable from any pebble distribution of $m$ pebbles. The optimal rubbling number is the smallest number $m$ needed to guarantee a pebble distribution of $m$ pebbles from which any vertex is reachable. We give bounds for rubbling and optimal rubbling numbers. In particular, we find an upper bound for the rubbling number of $n$-vertex, diameter $d$ graphs, and estimates for the maximum rubbling number of diameter 2 graphs. We also give a sharp upper bound for the optimal rubbling number, and sharp upper and lower bounds in terms of the diameter.

Recommendations

• Bounds on the rubbling and optimal rubbling numbers of graphs
• Optimal pebbling and rubbling of graphs with given diameter
• Rubbling and optimal rubbling of graphs
• The optimal rubbling number of ladders, prisms and Möbius-ladders
• 1-restricted optimal rubbling on graphs

Cites work

• A Graph Pebbling Algorithm on Weighted Graphs
• Distinct representatives of subsets
• scientific article; zbMATH DE number 1145909 (Why is no real title available?)
• scientific article; zbMATH DE number 1439473 (Why is no real title available?)
• Improved pebbling bounds
• Maximum pebbling number of graphs of diameter three
• Optimal pebbling of graphs
• Pebbling and optimal pebbling in graphs
• Pebbling in diameter two graphs and products of paths
• Rubbling and optimal rubbling of graphs
• The Complexity of Graph Pebbling

Cited in

(11)

• Rubbling and optimal rubbling of graphs
• 1-restricted optimal rubbling on graphs
• Domination cover rubbling
• Optimal pebbling and rubbling of graphs with given diameter
• Total domination cover rubbling
• Bounds on the rubbling and optimal rubbling numbers of graphs
• The optimal rubbling number of ladders, prisms and Möbius-ladders
• An introduction to t-restricted optimal rubbling
• Optimal t-rubbling on complete graphs and paths
• Strict optimal rubbling of graphs
• Rubbling and optimal rubbling of dense bipartite graphs

This page was built for publication: Bounds on the rubbling and optimal rubbling numbers of graphs

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