The following pages link to (Q4489489):
Displayed 10 items.
- Strong equality of Roman and weak Roman domination in trees (Q284830) (← links)
- \(\gamma\)-excellent, critically dominated, end-dominated, and dot-critical trees are equivalent (Q868329) (← links)
- A characterization of \((2\gamma ,\gamma _{\text p})\)-trees (Q932620) (← links)
- Total restrained domination in graphs with minimum degree two (Q952652) (← links)
- Constructive characterizations of \( (\gamma_p,\gamma)\)-and \( (\gamma_p, \gamma_{pr})\)-trees (Q1032812) (← links)
- Algorithm complexity of neighborhood total domination and \((\rho,\gamma_{\mathrm{nt}})\)-graphs (Q1702824) (← links)
- Construction of trees and graphs with equal domination parameters (Q2433721) (← links)
- On equality in an upper bound for the restrained and total domination numbers of a graph (Q2461210) (← links)
- Trees with equal domination and restrained domination numbers (Q2494314) (← links)
- On weakly connected domination in graphs. II. (Q2581406) (← links)