Graphs with equal eternal vertex cover and eternal domination numbers

DOI10.1016/j.disc.2011.03.026zbMath1223.05232OpenAlexW2057179567MaRDI QIDQ2275369

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

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

Related Items (14)

A Dynamic Domination Problem ⋮ On graphs whose eternal vertex cover number and vertex cover number coincide ⋮ Spy game: FPT-algorithm, hardness and graph products ⋮ Independent protection in graphs ⋮ Vertex covers and eternal dominating sets ⋮ Spy game: FPT-algorithm and results on graph products ⋮ A substructure based lower bound for eternal vertex cover number ⋮ m-Secure vertex cover of a graph ⋮ Spy-game on graphs: complexity and simple topologies ⋮ A dynamic domination problem in trees ⋮ A new lower bound for the eternal vertex cover number of graphs ⋮ Eternal and Secure Domination in Graphs ⋮ Eternally dominating large grids ⋮ Eternal vertex cover on bipartite graphs

Cites Work

• Parameterized algorithm for eternal vertex cover
• Tight bounds for eternal dominating sets in graphs
• Graph-theoretic parameters concerning domination, independence, and irredundance
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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