The co-secure domination in proper interval graphs

DOI10.1016/j.dam.2022.01.013zbMath1484.05162OpenAlexW4210936738MaRDI QIDQ2078841

Jia-Jie Liu, Shun-Chieh Chang, Chiun-Chieh Hsu, Yun-Hao Zou

Publication date: 4 March 2022

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

Full work available at URL: https://doi.org/10.1016/j.dam.2022.01.013

zbMATH Keywords

dominationproper interval graphsco-secure domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (5)

Complexity results on cosecure domination in graphs ⋮ Correcting the algorithm for a minimum secure dominating set of proper interval graphs by Zou, Liu, Hsu and Wang ⋮ 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
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Secure domination in proper interval graphs
• On the secure domination numbers of maximal outerplanar graphs
• A simple algorithm for secure domination in proper interval graphs
• Optimal greedy algorithms for indifference graphs
• Secure domination in cographs
• On secure domination in trees

This page was built for publication: The co-secure domination in proper interval graphs