Restricted optimal pebbling and domination in graphs

DOI10.1016/j.dam.2016.12.029zbMath1357.05111OpenAlexW2585465988MaRDI QIDQ512538

Teresa W. Haynes, Thomas M. Lewis, Mustapha Chellali, Stephen T. Hedetniemi

Publication date: 27 February 2017

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

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

zbMATH Keywords

dominationRoman dominationpebbling numberoptimal pebbling number

Mathematics Subject Classification ID

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 (2)

Distance restricted optimal pebbling in cycles ⋮ Capacity restricted optimal pebbling in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Using error-correcting codes to construct solvable pebbling distributions
• Dominating sets for split and bipartite graphs
• The optimal pebbling number of the caterpillar
• An addition theorem on the integers modulo \(n\)
• Roman domination in graphs.
• The optimal pebbling number of the complete \(m\)-ary tree
• Optimally pebbling hypercubes and powers
• A note on optimal pebbling of hypercubes
• Optimal pebbling of graphs
• Optimal Pebbling in Products of Graphs
• Pebbling in Hypercubes
• Pebbling and optimal pebbling in graphs
• The Complexity of Graph Pebbling

This page was built for publication: Restricted optimal pebbling and domination in graphs