Complexity issues of perfect secure domination in graphs

DOI10.1051/ita/2021012zbMath1483.05115OpenAlexW3208760304MaRDI QIDQ5037201

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)

Cites Work

• Counting independent sets in tree convex bipartite graphs
• The algorithmic use of hypertree structure and maximum neighbourhood orderings
• Algorithmic aspects of semitotal domination in graphs
• Threshold graphs and related topics
• On secure domination in graphs
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs
• Secure domination and secure total domination in graphs
• Dominating sets in n‐cubes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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