Complexity issues of perfect secure domination in graphs

DOI10.1051/ITA/2021012zbMATH Open1483.05115OpenAlexW3208760304MaRDI QIDQ5037201FDOQ5037201

Authors Padamutham Chakradhar, P. Venkata Subba Reddy

Publication date 28 February 2022

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1051/ita/2021012

zbMATH Keywords

NP-completesecure dominationperfect secure domination

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• The complexity of secure domination problem in graphs
• Complexity issues of variants of secure domination in graphs
• Perfect secure domination in graphs
• Algorithmic complexity of secure connected domination in graphs
• On secure domination in graphs
• Secure total domination in graphs: bounds and complexity
• Secure domination and secure total domination in graphs
• Secure total domination in graphs
• Algorithmic aspects of secure connected domination in graphs
• The secure domination problem in cographs

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 468643 (Why is no real title available?)
• scientific article; zbMATH DE number 2188604 (Why is no real title available?)
• scientific article; zbMATH DE number 2188623 (Why is no real title available?)
• Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs
• Algorithmic aspects of semitotal domination in graphs
• Counting independent sets in tree convex bipartite graphs
• Dominating sets in n‐cubes
• On secure domination in graphs
• Perfect \(k\)-domination in graphs
• Perfect secure domination in graphs
• Secure domination and secure total domination in graphs
• The algorithmic use of hypertree structure and maximum neighbourhood orderings
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Threshold graphs and related topics

Cited in

(5)

• Algorithmic aspects of 2-secure domination in graphs
• Perfect Italian domination on some generalizations of cographs
• On computing secure domination of trees
• Complexity issues of variants of secure domination in graphs
• Algorithmic aspects of some variants of domination in graphs

This page was built for publication: Complexity issues of perfect secure domination in graphs

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