Characteristic polynomials of some graph coverings (Q1896365): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q582916 |
||
Property / reviewed by | |||
Property / reviewed by: Q686285 / rank | |||
Revision as of 08:37, 16 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Characteristic polynomials of some graph coverings |
scientific article |
Statements
Characteristic polynomials of some graph coverings (English)
0 references
27 August 1995
0 references
Finite simple undirected graphs \(G = G(V,E)\) and their adjacency matrices \(A(G)\) are considered. By the characteristic polynomial \(\Phi (G; \lambda)\) of \(G\) we understand the determinant of \(\lambda I - A(G)\). Let \(D(G)\) be the set of the \(2 |E |\) directed edges (between elements of \(V)\) such that we take \((u,v)\) and \((v,u)\) for any element \([u,v]\) of \(E\). The authors introduce a graph \(G^\alpha\), called the derived graph of \((G, \alpha)\) [or a derived graph covering of \(G\) with voltages in \(\Gamma]\), where \(\alpha\) is a mapping of \(D(G)\) to a finite group \(\Gamma\) and \(\alpha (v,u) = (\alpha (u,v))^{-1}\) is postulated for any pair of adjacent vertices of \(G\). It is shown that \(\Phi (G^\alpha; \lambda)\) is divisible by \(\Phi (G; \lambda)\), the quotient polynomial is determined in terms of the irreducible representation of \(\Gamma\) and the Kronecker product of matrices.
0 references
characteristic polynomials
0 references
adjacency matrices
0 references
characteristic polynomial
0 references
derived graph
0 references
graph covering
0 references
quotient polynomial
0 references
irreducible representation
0 references
Kronecker product
0 references