Gain-line graphs via \(G\)-phases and group representations
DOI10.1016/j.laa.2020.11.009zbMath1459.05163arXiv2007.14839OpenAlexW3046185216MaRDI QIDQ2229460
Matteo Cavaleri, Alfredo Donno, Daniele D'Angeli
Publication date: 17 February 2021
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.14839
Fourier transformincidence matrixadjacency matrixgroup representationLaplacian matrixgain graphswitching equivalence\(G\)-phasegain-line graphoriented \(G\)-gain graph
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38) Signed and weighted graphs (05C22) Graph operations (line graphs, products, etc.) (05C76) Group actions on combinatorial structures (05E18)
Related Items (6)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Signed line graphs with least eigenvalue -2: the star complement technique
- Spectral properties of complex unit gain graphs
- Balance in gain graphs - a spectral analysis
- Oriented gain graphs, line graphs and eigenvalues
- Biased graphs. I: Bias, balance, and gains
- Signed graphs
- Orientation of signed graphs
- Laplacian matrices of graphs: A survey
- A mathematical bibliography of signed and gain graphs and allied areas
- Glossary of signed and gain graphs and allied areas
- Biased graphs IV: Geometrical realizations
- Balancedness and the least Laplacian eigenvalue of some complex unit gain graphs
- On the Laplacian coefficients of signed graphs
- Matrices in the Theory of Signed Simple Graphs
- Spectral criterion for cycle balance in networks
This page was built for publication: Gain-line graphs via \(G\)-phases and group representations