Mathematics · 2019 · 17 citations · 10 references
Natural SciencesMathematicsAlgebraCombinatoricsRepresentation TheoryGraph AlgorithmsGraph TheoryGroup TheorySpectral TheoryAdjacency MatricesAlgebraic Graph TheoryGainGraph LaplacianIncidence Matrix AnalysisSpectral Graph TheorySubdivision
Let T 4 = { ± 1 , ± i } be the subgroup of fourth roots of unity inside T , the multiplicative group of complex units. For a T 4 -gain graph Φ = ( Γ , T 4 , φ ) , we introduce gain functions on its line graph L ( Γ ) and on its subdivision graph S ( Γ ) . The corresponding gain graphs L ( Φ ) and S ( Φ ) are defined up to switching equivalence and generalize the analogous constructions for signed graphs. We discuss some spectral properties of these graphs and in particular we establish the relationship between the Laplacian characteristic polynomial of a gain graph Φ , and the adjacency characteristic polynomials of L ( Φ ) and S ( Φ ) . A suitably defined incidence matrix for T 4 -gain graphs plays an important role in this context.
10
Biased graphs. I. Bias, balance, and gains
Thomas Zasĺavsky · Journal of Combinatorial Theory Series B · 1989 · 213 citations
Hermitian Adjacency Matrix of Digraphs and Mixed Graphs
Krystal Guo, Bojan Mohar · Journal of Graph Theory · 2016 · 175 citations