Generalized connected domination in graphs - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics and Theoretical Computer Science Année : 2006

Generalized connected domination in graphs

Résumé

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.
Fichier principal
Vignette du fichier
dm080104.pdf (106.14 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00961101 , version 1 (19-03-2014)

Identifiants

Citer

Mekkia Kouider, Preben Dahl Vestergaard. Generalized connected domination in graphs. Discrete Mathematics and Theoretical Computer Science, 2006, Vol. 8, pp.57-64. ⟨10.46298/dmtcs.373⟩. ⟨hal-00961101⟩
95 Consultations
1143 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More