Recurrence among trees with most numerous efficient dominating sets - 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 : 2008

Recurrence among trees with most numerous efficient dominating sets

Résumé

A dominating set D of vertices in a graph G is called an efficient dominating set if the distance between any two vertices in D is at least three. A tree T of order n is called maximum if T has the largest number of efficient dominating sets among all n-vertex trees. A constructive characterization of all maximum trees is given. Their structure has recurring aspects with period 7. Moreover, the number of efficient dominating sets in maximum n-vertex trees is determined and is exponential. Also the number of maximum n-vertex trees is shown to be bounded below by an increasing exponential function in n.
Fichier principal
Vignette du fichier
610-3174-1-PB.pdf (158.54 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00972308 , version 1 (03-04-2014)

Identifiants

Citer

Dorota Bród, Zdzisław Skupień. Recurrence among trees with most numerous efficient dominating sets. Discrete Mathematics and Theoretical Computer Science, 2008, Vol. 10 no. 1 (1), pp.43--55. ⟨10.46298/dmtcs.445⟩. ⟨hal-00972308⟩

Collections

TDS-MACS
67 Consultations
747 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More