The Inverse Eigenvalue Problem of a Graph

Abstract

Historically, matrix theory and combinatorics have enjoyed a powerful, mutually beneficial relationship. Examples include: Perron-Frobenius theory describes the relationship between the combinatorial arrangement of the entries of a nonnegative matrix and the properties of its eigenvalues and eigenvectors (see [53, Chapter 8]). The theory of vibrations (e.g., of a system of masses connected by strings) provides many inverse problems (e.g., can the stiffness of the springs be prescribed to achieve a system with a given set of fundamental vibrations?) whose resolution intimately depends upon the families of matrices with a common graph (see [46, Chapter 7]). The Inverse Eigenvalue Problem of a graph (IEP-G), which is the focus of this chapter, is another such example of this relationship. The IEP-G is rooted in the 1960s work of Gantmacher, Krein, Parter and Fielder, but new concepts and techniques introduced in the last decade have advanced the subject significantly and catalyzed several mathematically rich lines of inquiry and application. We hope that this chapter will highlight these new ideas, while serving as a tutorial for those desiring to contribute to this expanding area