Pages that link to "Item:Q1786876"
From MaRDI portal
The following pages link to Secure total domination in graphs: bounds and complexity (Q1786876):
Displaying 8 items.
- Algorithmic results in secure total dominating sets on graphs (Q2136269) (← links)
- Total protection of lexicographic product graphs (Q2151225) (← links)
- From (secure) \(w\)-domination in graphs to protection of lexicographic product graphs (Q2239006) (← links)
- Graphs with diameter 2 and large total domination number (Q2657085) (← links)
- Secure connected domination and secure total domination in unit disk graphs and rectangle graphs (Q2700783) (← links)
- Eternal and Secure Domination in Graphs (Q3384616) (← links)
- Secure total domination in chain graphs and cographs (Q4956172) (← links)
- Secure domination of some graph operators (Q6089327) (← links)