This book offers an introduction to key topics in spectral graph theory. In spectral graph theory, various properties of graphs are studied using methods from linear algebra, particularly through the eigenvalues and eigenvectors of different matrices that describe the graph structure. Various aspects of graph theory find applications within the field of data science.
In this book, the necessary foundations of abstract graph theory and linear algebra are covered in parallel, making it suitable for students in their early semesters. The book has been tested multiple times in one-semester-long lectures and is therefore well-suited as a basis for a course and a collection of exercises for instructors.
Chapter
1. Elementary Theory.
Chapter
2. Graph Properties and Min-Max
Principle.
Chapter
3. Partitions and Eigenfunctions.
Chapter
4. Planarity
and Colin de Verdiére Invariant.
Kiyan Naderi is a researcher at Carl von Ossietzky University in Oldenburg, Germany.
Konstantin Pankrashkin is a professor for analysis and its applications at Carl von Ossietzky University in Oldenburg, Germany.
