Lifting Voltages in Graph Covers
Combinatorics
2025-01-29 v1
Abstract
We consider voltage digraphs, here referred to as graphs, whose edges are labeled with elements from a given group, and explore their derived graphs. Given two voltage graphs, with voltages in abelian groups, we establish a necessary and sufficient condition for their two derived graphs to be isomorphic. This condition requires: (1) the existence of a voltage graph that covers both given graphs, and (2) when the two sets of voltages are lifted to the common cover, the correspondence between these sets of voltages determines an isomorphism between the groups generated by these voltages. We show that conditions (1) and (2) are decidable, and provide a method for constructing the common cover and for lifting the voltage assignments.
Keywords
Cite
@article{arxiv.2501.17135,
title = {Lifting Voltages in Graph Covers},
author = {Natasha Jonoska and Mile Krajcevski and Gregory L. McColm},
journal= {arXiv preprint arXiv:2501.17135},
year = {2025}
}