A group representation approach to balance of gain graphs
From MaRDI portal
Publication:2045070
DOI10.1007/s10801-020-00977-wzbMath1470.05071arXiv2001.08490OpenAlexW3085364502MaRDI QIDQ2045070
Daniele D'Angeli, Matteo Cavaleri, Alfredo Donno
Publication date: 11 August 2021
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.08490
Ordinary representations and characters (20C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Other transforms and operators of Fourier type (43A32) Signed and weighted graphs (05C22)
Related Items (9)
Characterizations of line graphs in signed and gain graphs ⋮ On cospectrality of gain graphs ⋮ The integrality of distance spectra of quasiabelian 2-Cayley graphs ⋮ A switching method for constructing cospectral gain graphs ⋮ NEPS of complex unit gain graphs ⋮ Spectra of quaternion unit gain graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Spectral fundamentals and characterizations of signed directed graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Matrix convolution operators on groups
- Signed graphs
- Generating all graph coverings by permutation voltage assignments
- 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
- Characteristic polynomials of some graph coverings
- The spectra of lifted digraphs
- An algebraic approach to lifts of digraphs
- Shuffling matrices, Kronecker product and discrete Fourier transform
- Bounding the largest eigenvalue of signed graphs
- Balancedness and the least eigenvalue of Laplacian of signed graphs
- Criteria for balance in abelian gain graphs, with applications to piecewise-linear geometry
- Zur Theorie der Matrizen. II
- On the notion of balance of a signed graph
- Matrices in the Theory of Signed Simple Graphs
- Cycle and circle tests of balance in gain graphs: Forbidden minors and their groups
- A Matrix Application of Newton's Identities
- Spectral criterion for cycle balance in networks
This page was built for publication: A group representation approach to balance of gain graphs