RECENT TRENDS ON THE INVERSE EIGENVALUE PROBLEM FOR GRAPHS

Shaun M. Fallat, Professor at the University of Regina in the Department of Mathematics and Statistics 

(Learn more about the speaker here​)

ABSTRACT:

Given a simple graph G=(V,E) with V = {1,2,...n}, we associate a collection of real n-by-n symmetric matrices governed by G, and defined as S(G) where the off-diagonal entry in position (i,j) is nonzero iff i and j are adjacent.