Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2501.17135 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929690068910080 |
|---|---|
| author | Jonoska, Natasha Krajcevski, Mile McColm, Gregory L. |
| author_facet | Jonoska, Natasha Krajcevski, Mile McColm, Gregory L. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_17135 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Lifting Voltages in Graph Covers Jonoska, Natasha Krajcevski, Mile McColm, Gregory L. Combinatorics 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. |
| title | Lifting Voltages in Graph Covers |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2501.17135 |