Authors: Mekkia Kouider ¹; Preben Dahl Vestergaard ²

• 1 Laboratoire de Recherche en Informatique
• 2 Department of Mathematical Sciences [Aalborg]

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.