The purpose of this volume is to review the results in spectral graph theory which have appeared since 1978. The problem of characterizing graphs with least eigenvalue -2 was one of the original problems of spectral graph theory. The techniques used in the investigation of this problem have continued to be useful in other contexts including forbidden subgraph techniques as well as geometric methods involving root systems. In the meantime, the particular problem giving rise to these methods has been solved almost completely. This is indicated in Chapter 1. The study of various combinatorial objects (including distance regular and distance transitive graphs, association schemes, and block designs) have made use of eigenvalue techniques, usually as a method to show the nonexistence of objects with certain parameters. The basic method is to construct a graph which contains the structure of the combinatorial object and then to use the properties of the eigenvalues of the graph. Methods of this type are given in Chapter 2.
- ISBN10 0444703616
- ISBN13 9780444703613
- Publish Date January 1988 (first published 1 January 1988)
- Publish Status Out of Print
- Out of Print 17 October 2009
- Publish Country GB
- Publisher Taylor & Francis Ltd
- Imprint Elsevier Science Ltd
- Format Hardcover
- Pages 318
- Language English