Strong equality of domination parameters in trees
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2108130
- A characterization of trees with equal domination and total domination numbers.
- scientific article; zbMATH DE number 4055636
- Dominating sets and independent sets in a tree.
- Domination number, independent domination number and 2-independence number in trees
Cited in
(23)- Unicyclic graphs with strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers
- Graphs with strong equality on paired and double domination numbers
- Trees with equal domination and tree-free domination numbers
- Characterizations of trees with equal domination parameters
- Changing and unchanging of the domination number of a graph: path addition numbers
- Strong equality of Roman and weak Roman domination in trees
- scientific article; zbMATH DE number 1507962 (Why is no real title available?)
- \(\gamma\)-excellent, critically dominated, end-dominated, and dot-critical trees are equivalent
- Strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers in trees
- Perfectly relating the domination, total domination, and paired domination numbers of a graph
- Dominating sets and independent sets in a tree.
- A Gallai-type equality for the total domination number of a graph
- Strong equality of domination parameters in graphs
- Construction of trees and graphs with equal domination parameters
- Complexity of comparing the domination number to the independent domination, connected domination, and paired domination numbers
- Strong equality of upper domination and independence in trees
- Some notes on the isolate domination in graphs
- A characterization of \((2\gamma ,\gamma _{\text p})\)-trees
- scientific article; zbMATH DE number 4055636 (Why is no real title available?)
- Constructive characterizations of \( (\gamma_p,\gamma)\)-and \( (\gamma_p, \gamma_{pr})\)-trees
- Trees with equal domination and restrained domination numbers
- Vertices contained in all minimum paired-dominating sets of a tree
- A note on an induced subgraph characterization of domination perfect graphs
This page was built for publication: Strong equality of domination parameters in trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1861245)
