Eigenvalues, Multiplicities and Graphs

'The undirected graph of a real symmetric matrix tells you the sparsity structure of the matrix. That seems too little information to constrain the eigenvalues. Nevertheless as the matrix gets sparser some constraints appear, not on the actual eigenvalues but on their (algebraic) multiplicities. When the graph is sparse enough to be a tree there is a lot to say. The authors have collected scattered results, filled in key omissions, imposed systematic notation and concepts so that a rich and subtle theory, blending trees and matrices, unfolds before the reader. I, for one, am grateful.' Beresford Parlett, University of California, Berkeley

'This book provides a comprehensive survey and fresh perspectives on a fundamental inverse problem: how does the structure of a matrix impact its spectral properties? The inclusion of recently developed techniques, results and open questions will foster future research and applications.' Bryan Shader, University of Wyoming.

'The authors mention in the introduction that one goal of this book is to put together in one convenient place the fundamental ideas in this area to make it easier for students and new researchers on this subject to get started on some of the problems in the field. I believe that this goal has been achieved.' Sebastian M. Cioaba, Mathematical Reviews

'In this book, the multiplicity of eigenvalues in graph theory is discussed in detail. No matter the theoretical knowledge or the way of thinking of the reader, this book has good learning and reference value. At the same time, it also plays a great role in readers' study and research. Therefore, it is a meaningful book.' Xiaogang Liu, zbMATH