The optimal rubbling number of ladders, prisms and Möbius-ladders

DOI10.1016/J.DAM.2015.10.026zbMath1339.05390arXiv1411.0923OpenAlexW1832228128MaRDI QIDQ298981

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

Publication date: 21 June 2016

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

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

zbMATH Keywords

ladderrubbling

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (8)

Optimal t-rubbling on complete graphs and paths ⋮ Strict optimal rubbling of graphs ⋮ Total domination cover rubbling ⋮ Infinite families of circular and Möbius ladders that are total domination game critical ⋮ 1-restricted optimal rubbling on graphs ⋮ Domination cover rubbling ⋮ Optimal pebbling and rubbling of graphs with given diameter ⋮ Dominator and Total Dominator Colorings in Graphs

Cites Work

• Rubbling and optimal rubbling of graphs
• Pebbling graphs
• Pebbling and optimal pebbling in graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: The optimal rubbling number of ladders, prisms and Möbius-ladders