Vertex covers and eternal dominating sets

DOI10.1016/J.DAM.2011.11.034MaRDI QIDQ423932zbMATHOpenAlexFDO

Authors William F. Klostermeyer, Christina M. Mynhardt

Publication date 30 May 2012

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

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

zbMATH Keywords

vertex covereternal dominating set

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Graphs with equal eternal vertex cover and eternal domination numbers
• scientific article; zbMATH DE number 5575574
• An eternal vertex cover problem
• Tight bounds for eternal dominating sets in graphs
• Domination, eternal domination, and clique covering

Cites work

• scientific article; zbMATH DE number 2131198 (Why is no real title available?)
• 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?)
• scientific article; zbMATH DE number 817208 (Why is no real title available?)
• Edge protection in graphs
• Eternal security in graphs of fixed independence number
• Eternal total domination in graphs.
• 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

(16)

• A new lower bound for the eternal vertex cover number of graphs
• Eternal and Secure Domination in Graphs
• An eternal vertex cover problem
• Domination, eternal domination, and clique covering
• Eternal vertex cover on bipartite graphs
• A dynamic domination problem in trees
• A substructure based lower bound for eternal vertex cover number
• Mortal and eternal vertex covers
• Some algorithmic results for eternal vertex cover problem in graphs
• Independent protection in graphs
• Graphs with equal eternal vertex cover and eternal domination numbers
• On graphs whose eternal vertex cover number and vertex cover number coincide
• The eternal dominating set problem for proper interval graphs
• The eternal dominating set problem for interval graphs
• Trees with large \(m\)-eternal domination number
• Eternal domination and clique covering

This page was built for publication: Vertex covers and eternal dominating sets

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