%0 Journal Article
%T Generalized connected domination in graphs
%A M. Kouider
%A P.D. Vestergaard
%J Discrete Mathematics & Theoretical Computer Science
%D 2006
%I Discrete Mathematics & Theoretical Computer Science
%X As a generalization of connected domination in a graph G we consider domination by sets having at most k components. The order ¦Ã c k (G) of such a smallest set we relate to ¦Ã c (G), the order of a smallest connected dominating set. For a tree T we give bounds on ¦Ã c k (T) in terms of minimum valency and diameter. For trees the inequality ¦Ã c k (T)¡Ü n-k-1 is known to hold, we determine the class of trees, for which equality holds.
%U http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/460