Some new algorithmic results on co-secure domination in graphs

DOI10.1016/j.tcs.2024.114451OpenAlexW4391775165MaRDI QIDQ6190005

Kusum, Arti Pandey

Publication date: 5 March 2024

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

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

zbMATH Keywords

bipartite graphsNP-completedoubly chordal graphsco-secure dominationbounded clique-width graphs

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs
• Feedback vertex sets on restricted bipartite graphs
• 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
• Linear time solvable optimization problems on graphs of bounded clique-width
• Upper bounds to the clique width of 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
• Graph Theory
• Independent Domination on Tree Convex Bipartite Graphs
• Two Hardness Results on Feedback Vertex Sets
• Secure domination and secure total domination in graphs
• Reducibility among Combinatorial Problems
• Topics in Domination in Graphs
• ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
• Doubly chordal graphs, steiner trees, and connected domination
• Complexity results on cosecure domination in graphs

This page was built for publication: Some new algorithmic results on co-secure domination in graphs