Abstract
A gain graph over a group G, also referred to as G-gain graph, is a graph where an element of a group G, 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.
Original language | English |
---|---|
Article number | 113838 |
Number of pages | 9 |
Journal | Discrete Mathematics |
Volume | 347 |
Issue number | 4 |
DOIs | |
Publication status | Published - Apr 2024 |
Funding
We would like to thank the referees for their insightful and helpful comments. Aida Abiad is partially supported by FWO ( Research Foundation Flanders ) via the grant 1285921N . This research is supported by NWO ( Dutch Research Council ) via an ENW-KLEIN-1 project ( OCENW.KLEIN.475 ).
Funders | Funder number |
---|---|
Fonds Wetenschappelijk Onderzoek | 1285921N |
Nederlandse Organisatie voor Wetenschappelijk Onderzoek | OCENW.KLEIN.475 |
Keywords
- Adjacency matrix
- Cospectral
- Gain graph
- Switching