Eternally secure sets, independence sets and cliques
From MaRDI portal
Publication:2369386
zbMath1102.05043MaRDI QIDQ2369386
William F. Klostermeyer, Gary MacGillivray
Publication date: 9 May 2006
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Related Items (7)
Trees with large \(m\)-eternal domination number ⋮ The guarding game is E-complete ⋮ Independent protection in graphs ⋮ Eternal domination on prisms of graphs ⋮ Guard games on graphs: keep the intruder out! ⋮ Eternal and Secure Domination in Graphs ⋮ Domination, eternal domination, and clique covering
This page was built for publication: Eternally secure sets, independence sets and cliques
