Restricted optimal pebbling and domination in graphs

DOI10.1016/J.DAM.2016.12.029MaRDI QIDQ512538zbMATH OpenOpenAlexFDO

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

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

dominationoptimal pebbling numberpebbling numberRoman domination

Mathematics Subject Classification ID

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

Recommendations

• Domination cover pebbling: graph families
• Distance restricted optimal pebbling in cycles
• An introduction to t-restricted optimal rubbling
• Optimal pebbling of graphs
• The domination cover pebbling number of the square of a path

Cites work

• A note on optimal pebbling of hypercubes
• An addition theorem on the integers modulo n
• Dominating sets for split and bipartite graphs
• scientific article; zbMATH DE number 1145909 (Why is no real title available?)
• Optimal pebbling in products of graphs
• Optimal pebbling of graphs
• Optimally pebbling hypercubes and powers
• Pebbling and optimal pebbling in graphs
• Pebbling in Hypercubes
• Roman domination in graphs.
• The Complexity of Graph Pebbling
• The optimal pebbling number of square of paths and cycles.
• The optimal pebbling number of the caterpillar
• The optimal pebbling number of the complete \(m\)-ary tree
• Using error-correcting codes to construct solvable pebbling distributions

Cited in

(12)

• 1-restricted optimal rubbling on graphs
• Capacity restricted optimal pebbling in graphs
• Distance restricted optimal pebbling in cycles
• Inapproximability of the standard pebble game and hard to pebble graphs
• Pebbling and optimal pebbling in graphs
• NDC pebbling number for some class of graphs
• Restricted optimal pebbling is NP-hard
• On binary DCP labeling
• On the secure vertex cover pebbling number
• Pebbling number of polymers
• Optimal pebbling of complete binary trees and a meta-Fibonacci sequence
• 2-restricted optimal pebbling number of some dendrimers

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

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