Pages that link to "Item:Q861788"
From MaRDI portal
The following pages link to Irredundance, secure domination and maximum degree in trees (Q861788):
Displaying 19 items.
- Upper secure domination number of a graph (Q327666) (← links)
- A characterization of trees with equal independent domination and secure domination numbers (Q503603) (← links)
- Secure domination critical graphs (Q1045117) (← links)
- On computing a minimum secure dominating set in block graphs (Q1702842) (← links)
- The complexity of secure domination problem in graphs (Q1708386) (← links)
- The secure domination problem in cographs (Q1730021) (← links)
- Edge criticality in secure graph domination (Q1751134) (← links)
- Secure domination in rooted product graphs (Q2025078) (← links)
- Co-Roman domination in graphs (Q2344075) (← links)
- A linear algorithm for secure domination in trees (Q2449101) (← links)
- Secure restrained domination in graphs (Q2516512) (← links)
- Irredundance (Q3384112) (← links)
- Eternal and Secure Domination in Graphs (Q3384616) (← links)
- A lower bound for the irredundance number of trees (Q3508838) (← links)
- SECURE DOMINATING SETS IN THE LEXICOGRAPHIC PRODUCT OF GRAPHS (Q4973429) (← 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 equitability in graphs (Q6174164) (← links)