Capacity restricted optimal pebbling in graphs

DOI10.1016/J.DAM.2019.01.002MaRDI QIDQ1741523zbMATH OpenOpenAlexFDO

Authors 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) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)

Recommendations

• Pebbling and optimal pebbling in graphs
• Optimal pebbling of graphs
• Restricted optimal pebbling and domination in graphs
• Optimally \(t\)-pebbling graphs
• Optimal pebbling in products of graphs
• On the capacity of graphs
• Optimal pebbling number of graphs with given minimum degree
• The Complexity of Graph Pebbling
• Optimal pebbling and rubbling of graphs with given diameter
• Optimal \(t\)-pebbling in cycles

Cites work

• scientific article; zbMATH DE number 1145909 (Why is no real title available?)
• A note on optimal pebbling of hypercubes
• Optimally \(t\)-pebbling graphs
• Optimally pebbling hypercubes and powers
• Restricted optimal pebbling and domination in graphs
• The optimal pebbling number of the caterpillar
• The optimal pebbling number of the complete \(m\)-ary tree

Cited in

(4)

• An introduction to \(t\)-restricted optimal rubbling
• Pebbling and optimal pebbling in graphs
• Distance restricted optimal pebbling in cycles
• Restricted optimal pebbling is NP-hard

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1741523)