Spectral graph theory: Difference between revisions

Revision as of 00:04, 6 January 2005

Revision as of 01:08, 10 January 2005

Line 1:

In [[mathematics]], '''spectral [[graph theory]]''' is the study of properties of a graph in relationship to the [[eigenvalue]]s and [[eigenvector]]s of its [[adjacency matrix]]. An ''undirected'' graph has a [[symmetric matrix|symmetric]] adjacency matrix and therefore has real eigenvalues and a complete set of [[orthonormal]] eigenvectors.

== Specific Resultsresults ==

Let ''M'' be the [[adjacency matrix]] of a graph.