A switching method for constructing cospectral gain graphs

DOI10.1016/J.DISC.2023.113838MaRDI QIDQ6197703zbMATH OpenOpenAlexFDO

Authors Aida Abiad, Francesco Belardo, Antonina P. Khramova

Publication date 19 February 2024

Published in Discrete Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2304.03555

zbMATH Keywords

adjacency matrixcospectralgain graphswitching

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Relations of low-dimensional topology with graph theory (57M15)

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.

Recommendations

• On cospectrality of gain graphs
• Godsil-McKay switching for mixed and gain graphs over the circle group
• Gain-line graphs via \(G\)-phases and group representations
• Subgroup switching of skew gain graphs
• A group representation approach to balance of gain graphs

Cites work

• A group representation approach to balance of gain graphs
• Biased graphs. I: Bias, balance, and gains
• Characterizations of signed graphs
• Constructing cospectral graphs
• Constructing cospectral signed graphs
• Cospectral graphs, GM-switching and regular rational orthogonal matrices of level \(p\)
• Generating all graph coverings by permutation voltage assignments
• Godsil-McKay switching for mixed and gain graphs over the circle group
• On a theorem of Godsil and McKay concerning the construction of cospectral graphs
• On cospectrality of gain graphs
• On the notion of balance of a signed graph
• Signed graphs cospectral with the path
• Spectra of quaternion unit gain graphs
• Spectral characterizations of signed cycles
• Spectral characterizations of signed lollipop graphs
• Spectral fundamentals and characterizations of signed directed graphs
• Spectral properties of complex unit gain graphs

Cited in

(4)

• Construction of cospectral graphs, signed graphs and \(\mathbb{T}\)-gain graphs via partial transpose
• Godsil-McKay switchings for gain graphs
• Gain total graphs and their spectra via G-phases and group representations
• The NEPS of gain graphs over arbitrary groups and its spectra

This page was built for publication: A switching method for constructing cospectral gain graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6197703)