A note on the annihilation number and 2-domination number of a tree
From MaRDI portal
Publication:2359801
Recommendations
- Relating the annihilation number and the 2-domination number of a tree
- Bounding the domination number of a tree in terms of its annihilation number
- An upper bound on the double domination number of trees
- The annihilation number does not bound the 2-domination number from the above
- Relating the annihilation number and the total domination number of a tree
Cites work
- \(k\)-domination and \(k\)-independence in graphs: A survey
- A note on the k-domination number of a graph
- Degree sequence index strategy
- scientific article; zbMATH DE number 5919758 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 5037209 (Why is no real title available?)
- scientific article; zbMATH DE number 2230941 (Why is no real title available?)
- Implications of some observations about the k-domination number
- Independence and k-domination in graphs
- Relating the annihilation number and the 2-domination number of a tree
- Relating the annihilation number and the total domination number of a tree
Cited in
(7)- Relating the annihilation number and the 2-domination number of block graphs
- Relating the total domination number and the annihilation number for quasi-trees and some composite graphs
- The annihilation number does not bound the 2-domination number from the above
- The annihilation number and the total domination number of a tree-like graph
- Relating the annihilation number and the 2-domination number of a tree
- Relating the total domination number and the annihilation number of cactus graphs and block graphs
- Independent (k + 1)-domination in k-trees
This page was built for publication: A note on the annihilation number and 2-domination number of a tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2359801)