New bounds on the double domination number of trees
From MaRDI portal
Publication:2133403
The paper establishes improved upper and lower bounds for the double-domination number of trees. The proof uses induction and elementary combinatorial arguments. Two short corollaries are also given: trees attaining the upper bound are the ones with a double-domination number equal to the usual domination number, and a new upper bound for independent domination number of trees follows immediately from the known results.
Recommendations
Cites work
- A new lower bound on the double domination number of a graph
- A note on double domination in graphs
- A note on the double domination number in trees
- A survey of selected recent results on total domination in graphs
- An upper bound on the double domination number of trees
- Bounds on double domination numbers of graphs
- Domination parameters with number 2: interrelations and algorithmic consequences
- Double domination in lexicographic product graphs
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- scientific article; zbMATH DE number 1792607 (Why is no real title available?)
- Independent and double domination in trees
- On Double Domination in Graphs
- Topics in Domination in Graphs
- Total domination in graphs
Cited in
(19)- A new lower bound on the double domination number of a graph
- A note on the double domination number in trees
- \(k\)-domination and total \(k\)-domination numbers in catacondensed hexagonal systems
- Relating the total \(\{2\}\)-domination number with the total domination number of graphs
- On the double Roman domination number in trees
- Independent and double domination in trees
- scientific article; zbMATH DE number 2042782 (Why is no real title available?)
- An upper bound on the double domination number of trees
- Trees whose double domination number is twice their domination number
- Double domination in rooted product graphs
- On the domination of triangulated discs
- An improved upper bound on the domination number of a tree
- More on the complexity of defensive domination in graphs
- Double domination number of inflated graphs
- Independent domination in trees
- Double coalitions in regular graphs
- A note on extremal trees for a bound on the double domination number
- Double coalitions in graphs
- Domination number, independent domination number and k-independence number in trees
This page was built for publication: New bounds on the double domination number of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2133403)