Pages that link to "Item:Q4489489"
From MaRDI portal
The following pages link to Characterizations of trees with equal domination parameters (Q4489489):
Displaying 21 items.
- Strong equality of Roman and weak Roman domination in trees (Q284830) (← links)
- Triangulations and equality in the domination chain (Q494427) (← links)
- A characterization of trees with equal independent domination and secure domination numbers (Q503603) (← 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)
- Unique minimum semipaired dominating sets in trees (Q2107740) (← links)
- Restrained domination in self-complementary graphs (Q2227117) (← 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)
- Construction for trees without domination critical vertices (Q2671102) (← links)
- (Q2933596) (← links)
- A characterization of trees with equal 2-domination and 2-independence numbers (Q4557835) (← links)
- (Q4820525) (← links)
- (Q5104007) (← links)
- A characterization of trees having a minimum vertex cover which is also a minimum total dominating set (Q5377033) (← links)
- A note on total co-independent domination in trees (Q6641101) (← links)
