1-restricted optimal rubbling on graphs

DOI10.7151/dmgt.2102zbMath1404.05184OpenAlexW2804060951WikidataQ129781646 ScholiaQ129781646MaRDI QIDQ1717213

Teresa W. Haynes, Robert A. Beeler, Kyle Murphy

Publication date: 7 February 2019

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2102

zbMATH Keywords

graph pebbling\(t\)-restricted optimal pebblinggraph rubblingoptimal rubbling

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

Optimal t-rubbling on complete graphs and paths

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 complete \(m\)-ary tree
• Graham's pebbling conjecture on product of complete bipartite graphs
• Pebbling and Graham's conjecture
• Pebbling in diameter two graphs and products of paths
• Graham's pebbling conjecture on products of cycles

This page was built for publication: 1-restricted optimal rubbling on graphs