### On the inertia set of a graph

- Series
- Graph Theory Seminar
- Time
- Monday, October 6, 2008 - 11:05 for 1.5 hours (actually 80 minutes)
- Location
- Skiles 255
- Speaker
- Hein van der Holst – University of Eindhoven

For an undirected graph G=(V,E) with V={1,...,n} let S(G) be the set of all symmetric n x n matrices A=[a_i,j] with a_i,j non-zero for distinct i,j if and only if ij is an edge. The inertia of a symmetric matrix is the triple (p_+,p_-,p_0), where p_+, p_-,p_0 are the number of positive, negative, and null eigenvalues respectively. The inverse inertia problem asks which inertias can be obtained by matrices in S(G). This problem has been studied intensively by Barrett, Hall, and Loewy. In this talk I will present new results on the inverse inertia problem, among them a Colin de Verdiere type invariant for the inertia set (this is the set of all possible inertias) of a graph, a formula for the inertia set of graphs with a 2-separation, and a formula for the inertia set of the join of a collection of graphs.
The Colin de Verdiere type invariant for the inertia set is joint work with F. Barioli, S.M. Fallat, H.T. Hall, D. Hershkowitz, L. Hogben, and B. Shader, and the formula for the inertia set of the join of a collection of graphs is joint work with W. Barrett and H.T. Hall.