Cosecure domination: hardness results and algorithms

DOI10.1007/978-3-031-34347-6_21arXiv2302.13031OpenAlexW4379134728MaRDI QIDQ6182909

Kusum, Arti Pandey

Publication date: 22 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

NP-completenessbipartite graphsdoubly chordal graphsbounded tree-width graphscosecure domination

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dominating sets for split and bipartite graphs
• The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
• The algorithmic use of hypertree structure and maximum neighbourhood orderings
• The complexity of secure domination problem in graphs
• The co-secure domination in proper interval graphs
• Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee
• On secure domination in graphs
• Secure domination in cographs
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Two Hardness Results on Feedback Vertex Sets
• Secure domination and secure total domination in graphs
• Reducibility among Combinatorial Problems
• Structures of Domination in Graphs
• Topics in Domination in Graphs
• Doubly chordal graphs, steiner trees, and connected domination
• Complexity results on cosecure domination in graphs

This page was built for publication: Cosecure domination: hardness results and algorithms