On the complexity of co-secure dominating set problem

DOI10.1016/j.ipl.2023.106463arXiv2306.10378MaRDI QIDQ6195337

Soumyashree Rana, B. S. Panda, Sounaka Mishra

Publication date: 13 March 2024

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2306.10378

zbMATH Keywords

dominationapproximation algorithmsinapproximabilityAPX-completeco-secure domination

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation hardness of dominating set problems in bounded degree graphs
• The complexity of secure domination problem in graphs
• The co-secure domination in proper interval graphs
• On secure domination in graphs
• Secure domination in cographs
• Secure domination and secure total domination in graphs
• Perfect Elimination and Chordal Bipartite Graphs
• Algorithmic complexity of secure connected domination in graphs
• On computing secure domination of trees
• Topics in Domination in Graphs
• Complexity results on cosecure domination in graphs

This page was built for publication: On the complexity of co-secure dominating set problem