Other available formats:
Looking for an examination copy?
If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact email@example.com providing details of the course you are teaching.
Written 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.Read more
- 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
Review was not posted due to profanity×
- Date Published: July 2015
- format: Paperback
- isbn: 9781107545977
- length: 312 pages
- dimensions: 229 x 152 x 17 mm
- weight: 0.42kg
- contains: 35 b/w illus. 7 tables 90 exercises
- availability: Available
Table of Contents
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
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email firstname.lastname@example.orgRegister Sign in
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.Continue ×
Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.×