Inequalities for Graph Eigenvalues
About this book
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.
Tools to learn more effectively
Saving Books
Keyword Search
Annotating Text
Listen to it instead
Information
Table of contents
- Cover
- Series information
- Title page
- Copyright information
- 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
- Index
Frequently asked questions
- Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
- Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app