Generalizes graph coverings and unfoldings to weighted versions, proves analogous theorems to Leighton-Norris, and obtains a canonical factorization of universal coverings plus a weighted version of characteristic polynomial factorization.
On the complexity and combinatorics of covering finite complexes, Australasian J
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2022 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Unfoldings and coverings of weighted graphs
Generalizes graph coverings and unfoldings to weighted versions, proves analogous theorems to Leighton-Norris, and obtains a canonical factorization of universal coverings plus a weighted version of characteristic polynomial factorization.