Lower bound on the domination number of a tree
Discussiones Mathematicae. Graph Theory, Tome 24 (2004) no. 2, pp. 165-169
Voir la notice de l'article provenant de la source Library of Science
>We prove that the domination number γ(T) of a tree T on n ≥ 3 vertices and with n₁ endvertices satisfies inequality γ(T) ≥ (n+2-n₁)/3 and we characterize the extremal graphs.
Keywords:
domination number, tree
@article{DMGT_2004_24_2_a0,
author = {Lema\'nska, Magdalena},
title = {Lower bound on the domination number of a tree},
journal = {Discussiones Mathematicae. Graph Theory},
pages = {165--169},
publisher = {mathdoc},
volume = {24},
number = {2},
year = {2004},
language = {en},
url = {http://geodesic.mathdoc.fr/item/DMGT_2004_24_2_a0/}
}
Lemańska, Magdalena. Lower bound on the domination number of a tree. Discussiones Mathematicae. Graph Theory, Tome 24 (2004) no. 2, pp. 165-169. http://geodesic.mathdoc.fr/item/DMGT_2004_24_2_a0/