Improved bounds on the domination number of a tree
From MaRDI portal
Publication:406327
DOI10.1016/j.dam.2014.05.037zbMath1297.05175OpenAlexW2094190649MaRDI QIDQ406327
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
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)
Related Items
Largest domination number and smallest independence number of forests with given degree sequence ⋮ Revisiting \(k\)-tuple dominating sets with emphasis on small values of \(k\) ⋮ The set of all values of the domination number in trees with a given degree sequence ⋮ Bounds on the domination number of a digraph ⋮ Domination number and Laplacian eigenvalue of trees ⋮ Some comments on the Slater number ⋮ The Slater and sub-\(k\)-domination number of a graph with applications to domination and \(k\)-domination ⋮ A note on lower bounds for the total domination number of digraphs
Cites Work
