On the domination number of t-constrained de Bruijn 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 : 2022

On the domination number of t-constrained de Bruijn graphs

Résumé

Motivated by the work on the domination number of directed de Bruijn graphs and some of its generalizations, in this paper we introduce a natural generalization of de Bruijn graphs (directed and undirected), namely t-constrained de Bruijn graphs, where t is a positive integer, and then study the domination number of these graphs. Within the definition of t-constrained de Bruijn graphs, de Bruijn and Kautz graphs correspond to 1-constrained and 2-constrained de Bruijn graphs, respectively. This generalization inherits many structural properties of de Bruijn graphs and may have similar applications in interconnection networks or bioinformatics. We establish upper and lower bounds for the domination number on t-constrained de Bruijn graphs both in the directed and in the undirected case. These bounds are often very close and in some cases we are able to find the exact value.
Fichier principal
Vignette du fichier
2112.10426.pdf (479.77 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03832873 , version 1 (28-10-2022)

Licence

Paternité

Identifiants

Citer

Tiziana Calamoneri, Angelo Monti, Blerina Sinaimeri. On the domination number of t-constrained de Bruijn graphs. Discrete Mathematics and Theoretical Computer Science, 2022, 24 (2), ⟨10.46298/dmtcs.8879⟩. ⟨hal-03832873⟩
11 Consultations
21 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More