Capacity restricted optimal pebbling in graphs

DOI10.1016/j.dam.2019.01.002zbMath1409.05151OpenAlexW2914471257MaRDI QIDQ1741523

Chin-Lin Shiue

Publication date: 3 May 2019

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

Full work available at URL: https://doi.org/10.1016/j.dam.2019.01.002

zbMATH Keywords

treedominationpebbling

Mathematics Subject Classification ID

Trees (05C05) Games involving graphs (91A43) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (1)

Distance restricted optimal pebbling in cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Restricted optimal pebbling and domination in graphs
• The optimal pebbling number of the caterpillar
• The optimal pebbling number of the complete \(m\)-ary tree
• Optimally pebbling hypercubes and powers
• A note on optimal pebbling of hypercubes

This page was built for publication: Capacity restricted optimal pebbling in graphs