The following pages link to (Q5461705):
Displayed 22 items.
- Upper secure domination number of a graph (Q327666) (← links)
- A characterization of trees with equal independent domination and secure domination numbers (Q503603) (← links)
- Irredundance, secure domination and maximum degree in trees (Q861788) (← links)
- \(\gamma\)-excellent, critically dominated, end-dominated, and dot-critical trees are equivalent (Q868329) (← links)
- Secure domination critical graphs (Q1045117) (← links)
- The complexity of secure domination problem in graphs (Q1708386) (← links)
- Edge criticality in secure graph domination (Q1751134) (← links)
- Co-Roman domination in graphs (Q2344075) (← links)
- On secure domination in graphs (Q2348710) (← links)
- A linear algorithm for secure domination in trees (Q2449101) (← links)
- Secure restrained domination in graphs (Q2516512) (← links)
- On weakly connected domination in graphs. II. (Q2581406) (← links)
- m-Eternal total domination in graphs (Q2821121) (← links)
- Eternal and Secure Domination in Graphs (Q3384616) (← links)
- Complexity issues of perfect secure domination in graphs (Q5037201) (← links)
- Further results on secure restrained domination in graphs (Q5069776) (← links)
- On minimum secure dominating sets of graphs (Q5233913) (← links)
- On secure domination in trees (Q5236045) (← links)
- Secure vertex cover of a graph (Q5347260) (← links)
- Excellent graphs with respect to domination: subgraphs induced by minimum dominating sets (Q5862679) (← links)
- (Q6145882) (← links)
- Secure equitability in graphs (Q6174164) (← links)