The combinatorial inverse eigenvalue problems: complete graphs and small graphs with strict inequality

Abstract

Let G be a simple undirected graph on n vertices and let S(G) be the class of real symmetric n n matrices whose nonzero off-diagonal entries correspond exactly to the edges of G.