Graphs with equal eternal vertex cover and eternal domination numbers

DOI10.1016/J.DISC.2011.03.026MaRDI QIDQ2275369zbMATH OpenOpenAlexFDO

Authors William F. Klostermeyer, Christina M. Mynhardt

Publication date 8 August 2011

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2011.03.026

zbMATH Keywords

eternal dominating seteternal vertex cover

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

• An eternal vertex cover problem
• Vertex covers and eternal dominating sets
• Edge protection in graphs
• Domination, eternal domination, and clique covering
• scientific article; zbMATH DE number 5575574

Cites work

• Edge protection in graphs
• Eternal security in graphs of fixed independence number
• Eternal total domination in graphs.
• Graph-theoretic parameters concerning domination, independence, and irredundance
• 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?)
• Maximum-demand graphs for eternal security
• Parameterized algorithm for eternal vertex cover
• Tight bounds for eternal dominating sets in graphs

Cited in

(25)

• Spy-game on graphs: complexity and simple topologies
• Eternal vertex cover on bipartite graphs
• On graphs whose eternal vertex cover number and vertex cover number coincide
• A substructure based lower bound for eternal vertex cover number
• On graphs with minimal eternal vertex cover number
• Domination, eternal domination, and clique covering
• Spy game: FPT-algorithm, hardness and graph products
• Spy game: FPT-algorithm and results on graph products
• Eternal domination in trees
• Edge protection in graphs
• scientific article; zbMATH DE number 5968475 (Why is no real title available?)
• Eternal and Secure Domination in Graphs
• Independent protection in graphs
• Vertex covers and eternal dominating sets
• Bounds for the m-eternal domination number of a graph
• \(m\)-secure vertex cover of a graph
• A Dynamic Domination Problem
• A dynamic domination problem in trees
• Eternal Independent Sets in Graphs
• An eternal vertex cover problem
• Maximum-demand graphs for eternal security
• A new lower bound for the eternal vertex cover number of graphs
• Eternal feedback vertex sets: a new graph protection model using guards
• Computing eternal vertex cover number of maximal outerplanar graphs in linear time
• (Eternal) vertex cover numbers of infinite and finite grid graphs

This page was built for publication: Graphs with equal eternal vertex cover and eternal domination numbers

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