Protecting a graph with mobile guards
From MaRDI portal
Publication:5279864
DOI10.2298/AADM151109021KzbMath1461.05157arXiv1407.5228OpenAlexW2963436343MaRDI QIDQ5279864
William F. Klostermeyer, Christina M. Mynhardt
Publication date: 19 July 2017
Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1407.5228
Related Items (27)
Eternal domination and clique covering ⋮ Trees with large \(m\)-eternal domination number ⋮ ON THE CHARACTERIZATION OF ROMAN DOMINATING SETS IN TREES ⋮ Eternal dominating sets on digraphs and orientations of graphs ⋮ On the strong Roman domination number of graphs ⋮ Eternal domination: \(D\)-dimensional Cartesian and strong grids and everything in between ⋮ Independent protection in graphs ⋮ Eternal domination on prisms of graphs ⋮ Disjoint dominating sets with a perfect matching ⋮ Eternal distance-\(k\) domination on graphs ⋮ Dominating vertex covers: the vertex-edge domination problem ⋮ The eternal dominating set problem for interval graphs ⋮ Perfect Italian domination in trees ⋮ Eternal domination: criticality and reachability ⋮ Vertex-edge domination in graphs ⋮ Italian domination in trees ⋮ 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}\) ⋮ Unnamed Item ⋮ Eternal and Secure Domination in Graphs ⋮ Limit theory of combinatorial optimization for random geometric graphs ⋮ Eternally dominating large grids ⋮ 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: Protecting a graph with mobile guards
