Spectral Moments of Graphs and Some Applications
Dieter Gernert
Abstract
Dieter Gernert
Abstract
The spectral moments S k (k = 1,2,...) of a graph G, which are defined as the sum over the k th powers of all eigenvalues of the adjacency matrix A(G), have a lot of interesting properties. Here a geometrical interpretation, their connection with the coefficients of the characteristic polynomial of G, several inequalities, relations with other graph invariants, and some number-theoretical properties are presented. Possible applications are related to proofs in graph theory, the evaluation of certain graph-theoretical properties, and the counting of special subgraphs.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The spectral moments S k (k = 1,2,...) of a graph G, which are defined as the sum over the k th powers of all eigenvalues of the adjacency matrix A(G), have a lot of interesting properties. Here a geometrical interpretation, their connection with the coefficients of the characteristic polynomial of G, several inequalities, relations with other graph invariants, and some number-theoretical properties are presented. Possible applications are related to proofs in graph theory, the evaluation of certain graph-theoretical properties, and the counting of special subgraphs.
Key concepts: Adjacency matrix, Mathematics, Graph energy, Mathematical proof, Eigenvalues and eigenvectors, Spectral graph theory, Graph, Integral graph