Improved bounds on the domination number of a tree
From MaRDI portal
Publication:406327
DOI10.1016/J.DAM.2014.05.037zbMATH Open1297.05175OpenAlexW2094190649MaRDI QIDQ406327FDOQ406327
Authors: Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning 
Publication date: 8 September 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.05.037
Recommendations
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)
Cites Work
Cited In (12)
- The set of all values of the domination number in trees with a given degree sequence
- Largest domination number and smallest independence number of forests with given degree sequence
- A note on lower bounds for the total domination number of digraphs
- Revisiting \(k\)-tuple dominating sets with emphasis on small values of \(k\)
- An improved upper bound on the domination number of a tree
- The Slater and sub-\(k\)-domination number of a graph with applications to domination and \(k\)-domination
- On trees attaining an upper bound on the total domination number
- Improved bounds for the number of forests and acyclic orientations in the square lattice
- Domination number and Laplacian eigenvalue of trees
- A note: Some results in step domination of trees
- Bounds on the domination number of a digraph
- Some comments on the Slater number
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)
