Improved bounds on the domination number of a tree
From MaRDI portal
(Redirected from Publication:406327)
Recommendations
Cites work
Cited in
(12)- Bounds on the domination number of a digraph
- The Slater and sub-\(k\)-domination number of a graph with applications to domination and \(k\)-domination
- An improved upper bound on the domination number of a tree
- Largest domination number and smallest independence number of forests with given degree sequence
- A note: Some results in step domination of trees
- The set of all values of the domination number in trees with a given degree sequence
- Improved bounds for the number of forests and acyclic orientations in the square lattice
- Some comments on the Slater number
- A note on lower bounds for the total domination number of digraphs
- On trees attaining an upper bound on the total domination number
- Revisiting \(k\)-tuple dominating sets with emphasis on small values of \(k\)
- Domination number and Laplacian eigenvalue of trees
This page was built for publication: Improved bounds on the domination number of a tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q406327)