Characterizations of trees with equal domination parameters
From MaRDI portal
Publication:4489489
Recommendations
Cites work
Cited in
(21)- Construction for trees without domination critical vertices
- Trees with equal domination and restrained domination numbers
- scientific article; zbMATH DE number 2108130 (Why is no real title available?)
- A note on total co-independent domination in trees
- Strong equality of Roman and weak Roman domination in trees
- Total perfect codes in graphs realized by commutative rings
- Restrained domination in self-complementary graphs
- scientific article; zbMATH DE number 6376879 (Why is no real title available?)
- Unique minimum semipaired dominating sets in trees
- Constructive characterizations of \( (\gamma_p,\gamma)\)-and \( (\gamma_p, \gamma_{pr})\)-trees
- Construction of trees and graphs with equal domination parameters
- \(\gamma\)-excellent, critically dominated, end-dominated, and dot-critical trees are equivalent
- A characterization of trees having a minimum vertex cover which is also a minimum total dominating set
- Total restrained domination in graphs with minimum degree two
- scientific article; zbMATH DE number 1507962 (Why is no real title available?)
- On equality in an upper bound for the restrained and total domination numbers of a graph
- A characterization of \((2\gamma ,\gamma _{\text p})\)-trees
- A characterization of trees with equal independent domination and secure domination numbers
- Algorithm complexity of neighborhood total domination and \((\rho,\gamma_{\mathrm{nt}})\)-graphs
- A characterization of trees with equal 2-domination and 2-independence numbers
- On weakly connected domination in graphs. II.
This page was built for publication: Characterizations of trees with equal domination parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4489489)