Tight bounds for eternal dominating sets in graphs
From MaRDI portal
Publication:2427517
DOI10.1016/j.disc.2007.06.005zbMath1169.05035OpenAlexW2127236073WikidataQ126252579 ScholiaQ126252579MaRDI QIDQ2427517
John L. Goldwasser, William F. Klostermeyer
Publication date: 13 May 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.06.005
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Foolproof eternal domination in the all-guards move model, A Dynamic Domination Problem, The guarding game is E-complete, Exact algorithms for weak Roman domination, Spy game: FPT-algorithm, hardness and graph products, Secure vertex cover of a graph, Independent protection in graphs, Vertex covers and eternal dominating sets, Spy game: FPT-algorithm and results on graph products, To satisfy impatient web surfers is hard, Guard games on graphs: keep the intruder out!, A substructure based lower bound for eternal vertex cover number, Spy-game on graphs: complexity and simple topologies, Graphs with equal eternal vertex cover and eternal domination numbers, 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, Efficient and non-efficient domination of \(\mathbb{Z}\)-stacked Archimedean lattices, On eternal domination and Vizing-type inequalities, Domination, eternal domination, and clique covering
Cites Work
