Complexity results on cosecure domination in graphs

DOI10.1007/978-3-031-25211-2_26OpenAlexW4318023034MaRDI QIDQ6132550

Arti Pandey, Kusum

Publication date: 17 August 2023

Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-25211-2_26

zbMATH Keywords

perfect graphscographsNP-completeAPX-hardcosecure domination

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (3)

Cosecure domination: hardness results and algorithms ⋮ Some new algorithmic results on co-secure domination in graphs ⋮ On the complexity of co-secure dominating set problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dominating sets for split and bipartite graphs
• Approximation hardness of dominating set problems in bounded degree graphs
• Some APX-completeness results for cubic graphs
• The complexity of secure domination problem in graphs
• A simple linear time algorithm for cograph recognition
• An optimal path cover algorithm for cographs
• The co-secure domination in proper interval graphs
• On secure domination in graphs
• Secure domination in cographs
• Homogeneous sets and domination: A linear time algorithm for distance?hereditary graphs
• The Design of Approximation Algorithms
• Secure domination and secure total domination in graphs
• A Linear Recognition Algorithm for Cographs
• Algorithmic complexity of secure connected domination in graphs
• On computing secure domination of trees
• Structures of Domination in Graphs
• Topics in Domination in Graphs
• Analytical approach to parallel repetition

This page was built for publication: Complexity results on cosecure domination in graphs