scientific article; zbMATH DE number 2174620
From MaRDI portal
Publication:4681994
zbMath1067.05051MaRDI QIDQ4681994
Wayne Goddard, Stephen T. Hedetniemi, Sandra M. Hedetniemi
Publication date: 9 June 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (42)
Eternal domination and clique covering ⋮ Changing and unchanging in \(m\)-eternal total domination in graphs ⋮ Trees with large \(m\)-eternal domination number ⋮ A Dynamic Domination Problem ⋮ Eternal \(m\)-security bondage numbers in graphs ⋮ Eternal dominating sets on digraphs and orientations of graphs ⋮ Eternal domination: \(D\)-dimensional Cartesian and strong grids and everything in between ⋮ 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 ⋮ Disjoint dominating sets with a perfect matching ⋮ Tight bounds for eternal dominating sets in graphs ⋮ Vertex covers and eternal dominating sets ⋮ Spy game: FPT-algorithm and results on graph products ⋮ Guard games on graphs: keep the intruder out! ⋮ A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees ⋮ The eternal dominating set problem for interval graphs ⋮ A substructure based lower bound for eternal vertex cover number ⋮ Eternal domination: criticality and reachability ⋮ Study of a combinatorial game in graphs through linear programming ⋮ m-Secure vertex cover of a graph ⋮ Spy-game on graphs: complexity and simple topologies ⋮ Graphs with equal eternal vertex cover and eternal domination numbers ⋮ A survey on the relationship between the game of cops and robbers and other game representations ⋮ A note on the eternal dominating set problem ⋮ The game of cops and eternal robbers ⋮ Eternal domination of generalized Petersen graph ⋮ A method for eternally dominating strong grids ⋮ On eternal domination of generalized \(J_{s,m}\) ⋮ A dynamic domination problem in trees ⋮ A new lower bound for the eternal vertex cover number of graphs ⋮ Unnamed Item ⋮ Eternal and Secure Domination in Graphs ⋮ m-Eternal total domination in graphs ⋮ Unnamed Item ⋮ Eternally dominating large grids ⋮ Secure domination critical graphs ⋮ On eternal domination and Vizing-type inequalities ⋮ Domination, eternal domination, and clique covering ⋮ The eternal dominating set problem for proper interval graphs
This page was built for publication:
