On computing secure domination of trees

DOI10.1142/S1793830921500555MaRDI QIDQ5025125zbMATH OpenFDO

Authors Abolfazl Poureidi

Publication date 1 February 2022

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S1793830921500555

zbMATH Keywords

treedynamic programmingdominating setlinear algorithmsecure dominating set

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• On secure domination in trees
• A linear algorithm for secure domination in trees
• On secure domination in graphs
• Secure total domination in graphs: bounds and complexity
• The complexity of secure domination problem in graphs
• Algorithmic results in secure total dominating sets on graphs
• Secure total domination in graphs
• Algorithmic aspects of secure connected domination in graphs
• Algorithmic complexity of secure connected domination in graphs
• Complexity issues of perfect secure domination in graphs

Cites work

• scientific article; zbMATH DE number 2188604 (Why is no real title available?)
• A Nordhaus-Gaddum bound for Roman domination
• A linear algorithm for secure domination in trees
• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• Double Roman domination
• Double domination and super domination in trees
• Global total Roman domination in graphs
• On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs
• Rainbow domination in graphs
• Roman \(\{2 \}\)-domination

Cited in

(15)

• Complexity results on cosecure domination in graphs
• On connected co-independent domination in the join, corona and lexicographic product of graphs
• An improved binary programming formulation for the secure domination problem
• Two algorithms for secure graph domination
• Fair detour domination of graphs
• On the secure-domination number of the full balanced binary tree
• On computing a minimum secure dominating set in block graphs
• A linear algorithm for secure domination in trees
• scientific article; zbMATH DE number 5138367 (Why is no real title available?)
• On secure domination in trees
• PTASs for secure dominating set in planar graphs and growth-bounded graphs
• scientific article; zbMATH DE number 2188623 (Why is no real title available?)
• On the complexity of co-secure dominating set problem
• The secure domination problem in cographs
• Min-max dom-saturation number of a tree

This page was built for publication: On computing secure domination of trees

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