Unfoldings and Coverings of Weighted Graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Fundamenta Informaticae Année : 2023

Unfoldings and Coverings of Weighted Graphs

Résumé

Coverings of undirected graphs are used in distributed computing, and unfoldings of directed graphs in semantics of programs. We study these two notions from a graph theoretical point of view so as to highlight their similarities, as they are both dened in terms of surjective graph homomorphisms. In particular, universal coverings and complete unfoldings are innite trees that are regular if the initial graphs are nite. Regularity means that a tree has nitely many subtrees up to isomorphism. Two important theorems have been established by Leighton and Norris for coverings of nite graphs. We prove similar results for unfoldings of nite directed graphs. Moreover, we generalize coverings and similarly, unfoldings to graphs and digraphs equipped with nite or innite weights attached to edges of the covered or unfolded graphs. This generalization yields a canonical "factorization" of the universal covering of any nite graph, that (provably) does not exist without using weights. Introducing ω as an innite weight provides us with nite descriptions of regular trees having nodes of countably innite degree. Regular trees (trees having nitely many subtrees up to isomorphism) play an important role in the extension of Formal Language Theory to innite structures described in nitary ways. Our weighted graphs offer effective descriptions of the above mentioned regular trees and yield decidability results. We also generalize to weighted graphs and their coverings a classical factorization theorem of their characteristic polynomials.
Fichier principal
Vignette du fichier
BCcoveringFI2022.pdf (554.09 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04133626 , version 1 (20-06-2023)

Identifiants

Citer

Bruno Courcelle. Unfoldings and Coverings of Weighted Graphs. Fundamenta Informaticae, inPress, 1, pp.1-47. ⟨10.3233/FI-222149⟩. ⟨hal-04133626⟩

Collections

CNRS
14 Consultations
6 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More