The following pages link to Secure domination critical graphs (Q1045117):
Displaying 17 items.
- Global security in claw-free cubic graphs (Q401130) (← links)
- A characterization of trees with equal independent domination and secure domination numbers (Q503603) (← links)
- Global secure sets of grid-like graphs (Q628346) (← links)
- Secure domination in proper interval graphs (Q1671314) (← links)
- On the secure domination numbers of maximal outerplanar graphs (Q1693127) (← links)
- On computing a minimum secure dominating set in block graphs (Q1702842) (← links)
- The complexity of secure domination problem in graphs (Q1708386) (← links)
- Edge criticality in secure graph domination (Q1751134) (← links)
- Secure Italian domination in graphs (Q2025095) (← links)
- Exact algorithms for weak Roman domination (Q2413969) (← links)
- A linear algorithm for secure domination in trees (Q2449101) (← links)
- Eternal and Secure Domination in Graphs (Q3384616) (← links)
- The cost of edge removal in graph domination (Q4956237) (← links)
- SECURE DOMINATING SETS IN THE LEXICOGRAPHIC PRODUCT OF GRAPHS (Q4973429) (← links)
- On minimum secure dominating sets of graphs (Q5233913) (← links)
- On secure domination in trees (Q5236045) (← links)
- (Q6145882) (← links)