A switching method for constructing cospectral gain graphs

Aida Abiad Monge (Corresponding author), Francesco Belardo, Antonina Khramova

Research output: Contribution to journalArticleAcademicpeer-review

4 Citations (Scopus)
34 Downloads (Pure)

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 languageEnglish
Article number113838
Number of pages9
JournalDiscrete Mathematics
Volume347
Issue number4
DOIs
Publication statusPublished - 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 ).

FundersFunder number
Fonds Wetenschappelijk Onderzoek1285921N
Nederlandse Organisatie voor Wetenschappelijk OnderzoekOCENW.KLEIN.475

    Keywords

    • Adjacency matrix
    • Cospectral
    • Gain graph
    • Switching

    Fingerprint

    Dive into the research topics of 'A switching method for constructing cospectral gain graphs'. Together they form a unique fingerprint.

    Cite this