TY  - JOUR
ID  - Chaluvaraju2012
LB  - Chaluvaraju2012
AU  - Chaluvaraju, B.
AU  - Vidya, K. A.
TI  - Bounds on perfect k-domination in trees: an algorithmic approach
ST  - Bounds on perfect k-domination in trees: an algorithmic approach
JO  - Opuscula Math.
JA  - Opuscula Math.
JF  - Opuscula Mathematica
PY  - 2012
VL  - 32
IS  - 4
SP  - 707
EP  - 714
DO  - http://dx.doi.org/10.7494/OpMath.2012.32.4.707
UR  - http://dx.doi.org/10.7494/OpMath.2012.32.4.707
AB  - Let \(k\) be a positive integer and \(G = (V;E)\) be a graph. A vertex subset \(D\) of a graph \(G\) is called a perfect \(k\)-dominating set of \(G\) if every vertex \(v\) of \(G\) not in \(D\) is adjacent to exactly \(k\) vertices of \(D\). The minimum cardinality of a perfect \(k\)-dominating set of \(G\) is the perfect \(k\)-domination number \(\gamma_{kp}(G)\). In this paper, a sharp bound for \(\gamma_{kp}(T)\) is obtained where \(T\) is a tree.
KW  - \(k\)-domination
KW  - perfect domination
KW  - perfect \(k\)-domination
SN  - 1232-9274
ER  -