## Find a copy online

### Links to this item

## Find a copy in the library

Finding libraries that hold this item...

## Details

Genre/Form: | Electronic books |
---|---|

Additional Physical Format: | Print version: Recent results in the theory of graph spectra. Amsterdam ; New York : North-Holland ; New York, N.Y., U.S.A. : Sole distributors for the U.S.A. and Canada, Elsevier Science, 1988 (DLC) 87030577 (OCoLC)16985895 |

Material Type: | Document, Internet resource |

Document Type: | Internet Resource, Computer File |

All Authors / Contributors: |
Dragoš M Cvetković |

ISBN: | 9780444703613 0444703616 9780080867762 0080867766 1281793159 9781281793157 |

OCLC Number: | 316549646 |

Notes: | Includes indexes. |

Description: | 1 online resource (xi, 306 pages) : illustrations. |

Contents: | Front Cover; Recent Results in the Theory of Graph Spectra; Copyright Page; Introduction; Contents; Chapter 1. Characterizations of Graphs by their Spectra; Chapter 2. Distance-Regular and Similar Graphs; Chapter 3. Miscellaneous Results from the Theory of Graph Spectra; Chapter 4. The Matching Polynomial and Other Graph Polynomials; Chapter 5. Applications to Chemistry and Other Branches of Science; Chapter 6. Spectra of Infinite Graphs; Spectra of Graphs with Seven Vertices; Bibliography; Bibliographic Index; Index. |

Series Title: | Annals of discrete mathematics, 36. |

Other Titles: | Graph spectra |

Responsibility: | Dragoš M. Cvetković [and others]. |

### Abstract:

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. Several topics have been included in Chapter 3, including the relationships between the spectrum and automorphism group of a graph, the graph isomorphism and the graph reconstruction problem, spectra of random graphs, and the Shannon capacity problem. Some graph polynomials related to the characteristic polynomial are described in Chapter 4. These include the matching, distance, and permanental polynomials. Applications of the theory of graph spectra to Chemistry and other branches of science are described from a mathematical viewpoint in Chapter 5. The last chapter is devoted to the extension of the theory of graph spectra to infinite graphs.

## Reviews

*User-contributed reviews*

Add a review and share your thoughts with other readers.
Be the first.

Add a review and share your thoughts with other readers.
Be the first.

## Tags

Add tags for "Recent results in the theory of graph spectra".
Be the first.

## Similar Items

### Related Subjects:(5)

- Graph theory.
- Matrices.
- Graphes, Théorie des.
- MATHEMATICS -- Graphic Methods.
- Graphs -- Spectral theory