Bounds on the rubbling and optimal rubbling numbers of graphs

DOI10.1007/s00373-012-1146-2zbMath1329.05292arXiv1009.5162OpenAlexW2176954490MaRDI QIDQ2376084

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)

Related Items (4)

Optimal t-rubbling on complete graphs and paths ⋮ Strict optimal rubbling of graphs ⋮ Total domination cover rubbling ⋮ Domination cover rubbling

Cites Work

• Rubbling and optimal rubbling of graphs
• Improved pebbling bounds
• Optimal pebbling of graphs
• A Graph Pebbling Algorithm on Weighted Graphs
• Pebbling in diameter two graphs and products of paths
• Pebbling and optimal pebbling in graphs
• Maximum pebbling number of graphs of diameter three
• The Complexity of Graph Pebbling
• Distinct representatives of subsets
• Unnamed Item
• Unnamed Item

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