On computing secure domination of trees
From MaRDI portal
Publication:5025125
DOI10.1142/S1793830921500555zbMath1479.05284MaRDI QIDQ5025125
Publication date: 1 February 2022
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (3)
Complexity results on cosecure domination in graphs ⋮ On connected co-independent domination in the join, corona and lexicographic product of graphs ⋮ On the complexity of co-secure dominating set problem
Cites Work
- Unnamed Item
- Roman \(\{2 \}\)-domination
- Double Roman domination
- On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs
- Rainbow domination in graphs
- A linear algorithm for secure domination in trees
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- A Nordhaus–Gaddum bound for Roman domination
- Double domination and super domination in trees
- Global total Roman domination in graphs
This page was built for publication: On computing secure domination of trees
