Jump to content

Spectral graph theory

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Reina riemann (talk | contribs) at 14:55, 18 March 2004 (this is a stud). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Spectral graph theory is the study of properties of graph in relationship to the eigenvalues and eigenvectors of its adjacency matrix. An undirected graph has a symmetric adjacency matrix and therefore has a complete set of eigenvalues and orthonormal eigenvectors.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Spectral_graph_theory&oldid=2819139"