# Lower bound on the domination number of a tree

Discussiones Mathematicae Graph Theory (2004)

- Volume: 24, Issue: 2, page 165-169
- ISSN: 2083-5892

## Access Full Article

top## Abstract

top## How to cite

topMagdalena Lemańska. "Lower bound on the domination number of a tree." Discussiones Mathematicae Graph Theory 24.2 (2004): 165-169. <http://eudml.org/doc/270772>.

@article{MagdalenaLemańska2004,

abstract = {>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.},

author = {Magdalena Lemańska},

journal = {Discussiones Mathematicae Graph Theory},

keywords = {domination number; tree; extremal graphs},

language = {eng},

number = {2},

pages = {165-169},

title = {Lower bound on the domination number of a tree},

url = {http://eudml.org/doc/270772},

volume = {24},

year = {2004},

}

TY - JOUR

AU - Magdalena Lemańska

TI - Lower bound on the domination number of a tree

JO - Discussiones Mathematicae Graph Theory

PY - 2004

VL - 24

IS - 2

SP - 165

EP - 169

AB - >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.

LA - eng

KW - domination number; tree; extremal graphs

UR - http://eudml.org/doc/270772

ER -

## References

top- [1] O. Favaron, A bound on the independent domination number of a tree, Vishwa International Journal of Graph Theory 1 (1992) 19-27.
- [2] J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (Macmillan. London, 1976). Zbl1226.05083

## Citations in EuDML Documents

top## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.