Complexity results on cosecure domination in graphs
From MaRDI portal
Publication:6132550
DOI10.1007/978-3-031-25211-2_26OpenAlexW4318023034MaRDI QIDQ6132550FDOQ6132550
Authors: Kusum, Arti Pandey 
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
Cites Work
- The design of approximation algorithms
- Some APX-completeness results for cubic graphs
- An optimal path cover algorithm for cographs
- Title not available (Why is that?)
- Dominating sets for split and bipartite graphs
- A Linear Recognition Algorithm for Cographs
- Analytical approach to parallel repetition
- A simple linear time algorithm for cograph recognition
- Title not available (Why is that?)
- Approximation hardness of dominating set problems in bounded degree graphs
- On secure domination in graphs
- Secure domination and secure total domination in graphs
- Homogeneous sets and domination: A linear time algorithm for distance-hereditary graphs
- Secure domination in cographs
- Co-secure and secure domination in graphs
- Topics in Domination in Graphs
- The complexity of secure domination problem in graphs
- Structures of domination in graphs
- The co-secure domination in proper interval graphs
- Algorithmic complexity of secure connected domination in graphs
- On computing secure domination of trees
- Co-secure domination in Mycielski graphs
Cited In (4)
This page was built for publication: Complexity results on cosecure domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132550)
