Inequalities for Graph Eigenvalues
Inequalities for Graph Eigenvalues
Looking for an inspection copy?
This title is not currently available for inspection.
£66.00
GBPWritten for mathematicians working with the theory of graph spectra, this book explores more than 400 inequalities for eigenvalues of the six matrices associated with finite simple graphs: the adjacency matrix, Laplacian matrix, signless Laplacian matrix, normalized Laplacian matrix, Seidel matrix, and distance matrix. The book begins with a brief survey of the main results and selected applications to related topics, including chemistry, physics, biology, computer science, and control theory. The author then proceeds to detail proofs, discussions, comparisons, examples, and exercises. Each chapter ends with a brief survey of further results. The author also points to open problems and gives ideas for further reading.
- For the first time researchers and students can find all of the relevant results in a single volume
- Background material provided in the introduction provides access to anyone familiar with linear algebra and the theory of graph spectra
- Contains proofs, exercises and examples, making it suitable for use in a graduate course
Product details
July 2015Paperback
9781107545977
312 pages
229 × 152 × 17 mm
0.42kg
35 b/w illus. 7 tables 90 exercises
Available
Table of Contents
- Preface
- 1. Introduction
- 2. Spectral radius
- 3. Least eigenvalue
- 4. Second largest eigenvalue
- 5. Other eigenvalues of the adjacency matrix
- 6. Laplacian eigenvalues
- 7. Signless Laplacian eigenvalues
- 8. Inequalities for multiple eigenvalues
- 9. Other spectra of graphs
- References
- Inequalities
- Subject index.
