scientific article; zbMATH DE number 2104838
From MaRDI portal
Publication:4820838
zbMath1052.05054MaRDI QIDQ4820838
W. R. Gründlingh, E. J. Cockayne, Jan H. van Vuuren, W. Winterbach, Alewyn P. Burger, Christina M. Mynhardt
Publication date: 1 October 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (39)
Eternal domination and clique covering ⋮ Changing and unchanging in \(m\)-eternal total domination in graphs ⋮ Upper secure domination number of a graph ⋮ Trees with large \(m\)-eternal domination number ⋮ A Dynamic Domination Problem ⋮ Further results on secure restrained domination in graphs ⋮ Irredundance, secure domination and maximum degree in trees ⋮ 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 ⋮ Independent protection in graphs ⋮ Eternal domination on prisms of graphs ⋮ Tight bounds for eternal dominating sets in graphs ⋮ Vertex covers and eternal dominating sets ⋮ Guard games on graphs: keep the intruder out! ⋮ A linear algorithm for secure domination in trees ⋮ The eternal dominating set problem for interval graphs ⋮ Eternal domination: criticality and reachability ⋮ Study of a combinatorial game in graphs through linear programming ⋮ Edge criticality in secure graph domination ⋮ Graphs with equal eternal vertex cover and eternal domination numbers ⋮ A note on the eternal dominating set problem ⋮ 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 ⋮ Secure restrained domination in graphs ⋮ Eternal and Secure Domination in Graphs ⋮ On minimum secure dominating sets of graphs ⋮ Unnamed Item ⋮ Limit theory of combinatorial optimization for random geometric graphs ⋮ Roman domination problem with uncertain positioning and deployment costs ⋮ Eternally dominating large grids ⋮ Secure domination critical graphs ⋮ On eternal domination and Vizing-type inequalities ⋮ Domination, eternal domination, and clique covering ⋮ Co-Roman domination in graphs ⋮ The eternal dominating set problem for proper interval graphs
This page was built for publication:
