Maximum-demand graphs for eternal security

MaRDI QIDQ5442505zbMATH OpenFDO

Authors Christian Barrientos, Robert Brigham, Julie R. Carrington, Richard P. Vitray, Mark Anderson, Jay Yellen

Publication date 22 February 2008

zbMATH Keywords

dominationeternal securityindependencevertex clique cover

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Eternal m-security in certain classes of graphs
• scientific article; zbMATH DE number 2174620
• scientific article; zbMATH DE number 5575574
• Graphs with equal eternal vertex cover and eternal domination numbers
• An eternal vertex cover problem

Cited in

(19)

• Eternal m-security bondage numbers in graphs
• Graphs with equal eternal vertex cover and eternal domination numbers
• Domination, eternal domination, and clique covering
• Eternally secure sets, independence sets and cliques
• Eternal and Secure Domination in Graphs
• Eternal m-security in certain classes of graphs
• The guarding game is E-complete
• Independent protection in graphs
• Vertex covers and eternal dominating sets
• \(m\)-secure vertex cover of a graph
• Eternal domination and clique covering
• A Dynamic Domination Problem
• A dynamic domination problem in trees
• Eternal security in graphs of fixed independence number
• Complexity of eternal security
• Guard games on graphs: keep the intruder out!
• On the eternal domination number of planar graphs with diameter 2
• Fast winning strategies for the attacker in eternal domination
• Note on the eternal domination number of planar graphs and vertex-critical graphs

This page was built for publication: Maximum-demand graphs for eternal security

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