The following pages link to (Q2770439):
Displaying 11 items.
- A note on non-dominating set partitions in graphs (Q339496) (← links)
- Domination and total domination in cubic graphs of large girth (Q400535) (← links)
- Graphs that are simultaneously efficient open domination and efficient closed domination graphs (Q516892) (← links)
- Bondage numbers of Mycielski graphs (Q726515) (← links)
- A survey of selected recent results on total domination in graphs (Q998491) (← links)
- On total domination in the Cartesian product of graphs (Q1656910) (← links)
- Algorithm complexity of neighborhood total domination and \((\rho,\gamma_{\mathrm{nt}})\)-graphs (Q1702824) (← links)
- Total domination versus domination in cubic graphs (Q1706439) (← links)
- On trees with unique locating kernels (Q2233388) (← links)
- An algorithm to check the equality of total domination number and double of domination number in graphs (Q5099751) (← links)
- Relating ordinary and total domination in cubic graphs of large girth (Q5419942) (← links)
