Science Fair Project Encyclopedia
Spectral graph theory
In mathematics, spectral graph theory is the study of properties of a graph in relationship to the characteristic polynomials, eigenvalues and eigenvectors of its adjacency matrix or Laplace matrix. An undirected graph has a symmetric adjacency matrix and therefore has real eigenvalues and a complete set of orthonormal eigenvectors.
While the adjacency matrix depends on the vertex labeling, its spectrum is a graph invariant.
Let M be the adjacency matrix of a graph.
The characteristic polynomial of the graph is
- pM(t) = det(M − tI)
Given a particular polynomial, it is not known if a corresponding adjacency matrix can be deduced. Two graphs are said to be isospectral if the adjacency matrices of the graphs have the same eigenvalues. Isospectral graphs need not be isomorphic, but isomorphic graphs are always isospectral, because the characteristic polynomial is a topological invariant of the graph.
The Ihara zeta function of the graph is given by
and is another topological invariant of the graph.
The Ihara zeta function of a k-regular connected graph satisfies the Riemann hypothesis if and only if the graph is a Ramanujan graph. A graph is k-regular if every vertex has the same number of incoming and outgoing arcs.
The Perlis theorem states that
where nM(k) is the number of closed paths (with no backtracking or repetition) of length k. The Ihara-Hashimoto-Bass theorem relates the zeta function to the Euler characteristic of the graph.
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details