Extension of universal cycles for globally identifying colorings of cycles - LAAS - Laboratoire d'Analyse et d'Architecture des Systèmes Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics Année : 2017

Extension of universal cycles for globally identifying colorings of cycles

Résumé

In 1998, Karpovsky, Chakrabarty and Levitin introduced identifying codes to model fault diagnosis in multiprocessor systems [1]. In these codes, each vertex is identified by the vertices belonging to the code in its neighborhood. There exists a coloring variant as follows: a globally identifying coloring of a graph is a coloring such that each vertex is identified by the colors in its neighborhood. We aim at finding the maximum length of a cycle with such a coloring, given a fixed number of colors we can use. Parreau [2] used Jackson's work [3] on universal cycles to give a lower bound of this length. In this article, we will adapt what Jackson did, to improve this result.
Fichier principal
Vignette du fichier
cycles.pdf (189.28 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01704385 , version 1 (08-02-2018)

Identifiants

Citer

Pierre Coupechoux. Extension of universal cycles for globally identifying colorings of cycles. Discrete Mathematics, 2017, 340 (7), pp.1456-1466. ⟨10.1016/j.disc.2017.02.002⟩. ⟨hal-01704385⟩
30 Consultations
11 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More