Spectral Graph Theory of the Hypercube
Abstract
In Graph Theory, every graph can be expressed in terms of certain real, symmetric matrices derived from the graph, most notably the adjacency or Laplacian matrices. Spectral Graph Theory focuses on the set of eigenvalues and eigenvectors, called the spectrum, of these matrices and provides several interesting areas of study. One of these is the inverse eigenvalue problem of a graph, which tries to determine information about the possible eigenvalues of the real symmetric matrices whose pattern of nonzero entries is described by a given graph. A second area is the energy of a graph, defined to be the sum of the absolute values of the eigenvalues of the adjacency matrix of that graph.
Document Details
- Document Type
- Technical Report
- Publication Date
- Dec 01, 2008
- Accession Number
- ADA493796
Entities
People
- Stanley F. Florkowski Iii
Organizations
- Naval Postgraduate School