A Dynamic Domination Problem

DOI10.1080/09720529.2015.1026457zbMATH Open1495.05230OpenAlexW2274810097MaRDI QIDQ5069748FDOQ5069748

Authors William F. Klostermeyer 

Publication date 19 April 2022

Published in Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720529.2015.1026457

zbMATH Keywords

domination numberindependence number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites work

• scientific article; zbMATH DE number 5575574 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 2174620 (Why is no real title available?)
• scientific article; zbMATH DE number 2104838 (Why is no real title available?)
• Eternal domination numbers of \(4\times n\) grid graphs
• Eternal protection in grid graphs
• Eternal security in graphs of fixed independence number
• Graphs with equal eternal vertex cover and eternal domination numbers
• Maximum-demand graphs for eternal security
• Tight bounds for eternal dominating sets in graphs

Cited in

(2)

• A dynamic domination problem in trees
• Domino Problem Under Horizontal Constraints

This page was built for publication: A Dynamic Domination Problem

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