The following pages link to (Q4826280):
Displayed 20 items.
- Roman \(\{2 \}\)-domination (Q266795) (← links)
- Changing and unchanging in \(m\)-eternal total domination in graphs (Q327647) (← links)
- Upper secure domination number of a graph (Q327666) (← links)
- Roman domination on strongly chordal graphs (Q385486) (← links)
- Independent protection in graphs (Q400447) (← links)
- Guard games on graphs: keep the intruder out! (Q650877) (← links)
- Bounds on weak Roman and 2-rainbow domination numbers (Q741531) (← links)
- Irredundance, secure domination and maximum degree in trees (Q861788) (← links)
- Secure domination critical graphs (Q1045117) (← links)
- On computing a minimum secure dominating set in block graphs (Q1702842) (← links)
- Edge criticality in secure graph domination (Q1751134) (← links)
- Eternally dominating large grids (Q2328863) (← links)
- Co-Roman domination in graphs (Q2344075) (← links)
- Tight bounds for eternal dominating sets in graphs (Q2427517) (← links)
- A linear algorithm for secure domination in trees (Q2449101) (← links)
- Secure restrained domination in graphs (Q2516512) (← links)
- m-Eternal total domination in graphs (Q2821121) (← links)
- Eternal and Secure Domination in Graphs (Q3384616) (← links)
- Further results on secure restrained domination in graphs (Q5069776) (← links)
- On minimum secure dominating sets of graphs (Q5233913) (← links)