A switching method for constructing cospectral gain graphs
Combinatorics
2023-04-10 v1
Abstract
A gain graph over a group , also referred to as -gain graph, is a graph where an element of a group , called gain, is assigned to each oriented edge, in such a way that the inverse element is associated with the opposite orientation. Gain graphs can be regarded as a generalization of signed graphs, among others. In this work, we show a new switching method to construct cospectral gain graphs. Some previous methods known for graph cospectrality follow as a corollary of our results.
Cite
@article{arxiv.2304.03555,
title = {A switching method for constructing cospectral gain graphs},
author = {Aida Abiad and Francesco Belardo and Antonina P. Khramova},
journal= {arXiv preprint arXiv:2304.03555},
year = {2023}
}