%0 Journal Article
%T Bounding the domination number of a tree in terms of its annihilation number
%A Nasrin Dehgardai
%A Sepideh Norouzian
%A Seyed Mahmoud Sheikholeslami
%J Transactions on Combinatorics
%D 2013
%I University of Isfahan
%X A set $S$ of vertices in a graph $G$ is a dominating set if every vertex of $V-S$ is adjacent to some vertex in $S$. The domination number $gamma(G)$ is the minimum cardinality of a dominating set in $G$. The annihilation number $a(G)$ is the largest integer $k$ such that the sum of the first $k$ terms of the non-decreasing degree sequence of $G$ is at most the number of edges in $G$. In this paper, we show that for any tree $T$ of order $nge 2$, $gamma(T)le frac{3a(T)+2}{4}$, and we characterize the trees achieving this bound.
%K annihilation number
%K dominating set
%K domination number
%U http://www.combinatorics.ir/?_action=showPDF&article=2652&_ob=612d7d59109d68ddebd8575798fb9f33&fileName=full_text.pdf.