Optimal pebbling and rubbling of graphs with given diameter

DOI10.1016/j.dam.2018.06.014zbMath1464.05265arXiv1708.09177OpenAlexW2963423189WikidataQ129599310 ScholiaQ129599310MaRDI QIDQ2026352

László F. Papp, Gyula Y. Katona, Ervin Gyoeri

Publication date: 19 May 2021

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

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

zbMATH Keywords

diameterrubblinggraph pebblingdistance domination

Mathematics Subject Classification ID

Games involving graphs (91A43) Distance in graphs (05C12) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (2)

Optimal t-rubbling on complete graphs and paths ⋮ Strict optimal rubbling of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The optimal rubbling number of ladders, prisms and Möbius-ladders
• Rubbling and optimal rubbling of graphs
• The optimal pebbling number of the caterpillar
• The optimal pebbling number of the complete \(m\)-ary tree
• The optimal pebbling number of staircase graphs
• Optimal pebbling of graphs
• Optimal Pebbling in Products of Graphs
• Pebbling in Hypercubes
• Pebbling and optimal pebbling in graphs
• The Complexity of Graph Pebbling

This page was built for publication: Optimal pebbling and rubbling of graphs with given diameter