Algorithmic results in secure total dominating sets on graphs

DOI10.1016/J.TCS.2022.03.016OpenAlexW4221042980MaRDI QIDQ2136269

Abolfazl Poureidi

Publication date: 10 May 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.03.016

zbMATH Keywords

NP-completeAPX-completelinear-time algorithmsecure total dominating set

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Secure connected domination and secure total domination in unit disk graphs and rectangle graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation hardness of dominating set problems in bounded degree graphs
• Optimization, approximation, and complexity classes
• The complexity of domination problems in circle graphs
• Some APX-completeness results for cubic graphs
• The complexity of secure domination problem in graphs
• Secure total domination in graphs: bounds and complexity
• Secure domination and secure total domination in graphs
• Secure total domination in chain graphs and cographs

This page was built for publication: Algorithmic results in secure total dominating sets on graphs