The following pages link to (Q4506068):
Displayed 12 items.
- Strong equality of Roman and weak Roman domination in trees (Q284830) (← links)
- A note on an induced subgraph characterization of domination perfect graphs (Q516908) (← 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)
- 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)
- Restrained domination in self-complementary graphs (Q2227117) (← links)
- Construction of trees and graphs with equal domination parameters (Q2433721) (← links)
- On weakly connected domination in graphs. II. (Q2581406) (← links)
- Unique irredundance, domination and independent domination in graphs (Q2581412) (← links)
- Graphs with equal domination and independent domination numbers (Q5012363) (← links)
- A dynamic domination problem in trees (Q5134345) (← links)