Distance restricted optimal pebbling in cycles

DOI10.1016/j.dam.2019.10.017zbMath1443.05152OpenAlexW2982514882WikidataQ126856798 ScholiaQ126856798MaRDI QIDQ2181222

Chin-Lin Shiue

Publication date: 18 May 2020

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

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

zbMATH Keywords

cycleregular graphpebblingRoman domination number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Games involving graphs (91A43) Distance in graphs (05C12) 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 paths

Cites Work

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

This page was built for publication: Distance restricted optimal pebbling in cycles