Title from publisher's bibliographic system (viewed on 05 Oct 2015).

1. A background in graph spectra -- 2. Eigenvectors of graphs -- 3. Eigenvector techniques -- 4. Graph angles -- 5. Angle techniques -- 6. Graph perturbations -- 7. Star partitions -- 8. Canonical star bases -- 9. Miscellaneous results -- App. A. Some results from matrix theory -- App. B.A table of graph angles.

Current research on the spectral theory of finite graphs may be seen as part of a wider effort to forge closer links between algebra and combinatorics (in particular between linear algebra and graph theory).This book describes how this topic can be strengthened by exploiting properties of the eigenspaces of adjacency matrices associated with a graph. The extension of spectral techniques proceeds at three levels: using eigenvectors associated with an arbitrary labelling of graph vertices, using geometrical invariants of eigenspaces such as graph angles and main angles, and introducing certain kinds of canonical eigenvectors by means of star partitions and star bases. One objective is to describe graphs by algebraic means as far as possible, and the book discusses the Ulam reconstruction conjecture and the graph isomorphism problem in this context. Further problems of graph reconstruction and identification are used to illustrate the importance of graph angles and star partitions in relation to graph structure. Specialists in graph theory will welcome this treatment of important new research.