A switching method for constructing cospectral gain graphs
From MaRDI portal
Publication:6197703
DOI10.1016/j.disc.2023.113838arXiv2304.03555OpenAlexW4389918271MaRDI QIDQ6197703
Aida Abiad, Antonina P. Khramova, Francesco Belardo
Publication date: 19 February 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2304.03555
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Relations of low-dimensional topology with graph theory (57M15)
Cites Work
- Spectral properties of complex unit gain graphs
- Constructing cospectral graphs
- Biased graphs. I: Bias, balance, and gains
- Generating all graph coverings by permutation voltage assignments
- Signed graphs cospectral with the path
- Spectral characterizations of signed cycles
- Cospectral graphs, GM-switching and regular rational orthogonal matrices of level \(p\)
- A group representation approach to balance of gain graphs
- Spectral fundamentals and characterizations of signed directed graphs
- On cospectrality of gain graphs
- On a theorem of Godsil and McKay concerning the construction of cospectral graphs
- Godsil-McKay switching for mixed and gain graphs over the circle group
- Spectra of quaternion unit gain graphs
- Spectral characterizations of signed lollipop graphs
- On the notion of balance of a signed graph
- Characterizations of signed graphs
- Constructing cospectral signed graphs
This page was built for publication: A switching method for constructing cospectral gain graphs
