Eternal domination in trees

zbMATH Open1310.05161arXiv2112.03107MaRDI QIDQ2940106FDOQ2940106

Authors: William F. Klostermeyer, Gary MacGillivray 

Publication date: 26 January 2015

Abstract: Mobile guards on the vertices of a graph are used to defend the graph against an infinite sequence of attacks on vertices. A guard must move from a neighboring vertex to an attacked vertex (we assume attacks happen only at vertices containing no guard). More than one guard is allowed to move in response to an attack. The $m$-eternal domination number is the minimum number of guards needed to defend the graph. We characterize the trees achieving several upper and lower bounds on the $m$-eternal domination number.

Full work available at URL: https://arxiv.org/abs/2112.03107

Recommendations

• Trees with large \(m\)-eternal domination number
• Bounds for the \(m\)-eternal domination number of a graph
• scientific article; zbMATH DE number 5575574
• Foolproof eternal domination in the all-guards move model
• Graphs with equal eternal vertex cover and eternal domination numbers

zbMATH Keywords

dominating setindependent setconnected dominating seteternal dominating setneo-colonization

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cited In (10)

• Independent protection in graphs
• Eternal and Secure Domination in Graphs
• Bounds for the \(m\)-eternal domination number of a graph
• Edge protection in graphs
• Foolproof eternal domination in the all-guards move model
• Trees with large \(m\)-eternal domination number
• Eternal peace in the tug-of-war?
• Eternal distance-\(k\) domination on graphs
• Eternal Independent Sets in Graphs
• Application of eternal domination in epidemiology

This page was built for publication: Eternal domination in trees

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