Lower bound on the domination number of a tree

DOI10.7151/dmgt.1222zbMath1063.05035OpenAlexW1981710557MaRDI QIDQ4669425

Magdalena Lemańska

Publication date: 15 April 2005

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1222

zbMATH Keywords

treeextremal graphsdomination number

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (23)

Total double Roman domination in graphs ⋮ Domination, independent domination and \(k\)-independence in trees ⋮ Largest domination number and smallest independence number of forests with given degree sequence ⋮ Unnamed Item ⋮ ON GRAPHS WITH PAIRWISE DISJOINT EFFICIENT DOMINATING SETS AND EFFICIENT DOMINATION IN TREES IN TERMS OF SUPPORT VERTICES ⋮ The set of all values of the domination number in trees with a given degree sequence ⋮ Improved bounds on the domination number of a tree ⋮ Bounds on the hop domination number of a tree ⋮ Sublinear-space streaming algorithms for estimating graph parameters on sparse graphs ⋮ Bounds on the vertex-edge domination number of a tree ⋮ Total restrained domination numbers of trees ⋮ Domination number and Laplacian eigenvalue of trees ⋮ Some comments on the Slater number ⋮ The limit case of a domination property ⋮ $k$-distance enclaveless number of a graph ⋮ The Slater and sub-\(k\)-domination number of a graph with applications to domination and \(k\)-domination ⋮ On the independent set sequence of a tree ⋮ A note on neighborhood total domination in graphs ⋮ A new lower bound on the domination number of a graph ⋮ Bounds on total edge domination number of a tree ⋮ A lower bound for the distance \(k\)-domination number of trees ⋮ Upper paired domination versus upper domination ⋮ A classification of cactus graphs according to their domination number

This page was built for publication: Lower bound on the domination number of a tree