Pages that link to "Item:Q2878212"
From MaRDI portal
The following pages link to Co-secure and secure domination in graphs (Q2878212):
Displaying 11 items.
- The possible cardinalities of global secure sets in cographs (Q764303) (← links)
- Secure domination in rooted product graphs (Q2025078) (← links)
- The co-secure domination in proper interval graphs (Q2078841) (← links)
- Co-Roman domination in graphs (Q2344075) (← links)
- Eternal and Secure Domination in Graphs (Q3384616) (← links)
- Certified domination (Q5154565) (← links)
- Protection of a network by complete secure domination (Q5884131) (← links)
- Correcting the algorithm for a minimum secure dominating set of proper interval graphs by Zou, Liu, Hsu and Wang (Q6157427) (← links)
- Some new algorithmic results on co-secure domination in graphs (Q6190005) (← links)
- On the complexity of co-secure dominating set problem (Q6195337) (← links)
- The algorithm and complexity of co-secure domination in geometric intersection graphs (Q6653927) (← links)