Eigenvalues of Graphs

Minimum Number of Distinct Eigenvalues of Graphs

Speaker: Shahla Nasserasr, Ph.D., NSU Assistant Professor
Date: Tuesday, November 15
Time:11:30 a.m. -1:00 p.m.
Venue: Mailman-Hollywood Building | Second Floor Auditorium

For a simple graph G on n vertices, a real symmetric nxn matrix A is said to be compatible with G, if for different i and j, the (I,j) entry of A is nonzero whenever there is an edge between the vertices i and j, it is zero otherwise. The minimum number of distinct eigenvalues, when minimum is taken over all compatible matrices with G, is denoted by q(G). In this talk, a survey of some known and new results about q(G) is presented.

About the Speaker
Shahla Nasserasr has a master’s degree from the University of Victoria, BC, Canada, and a Ph.D. from the College of William and Mary, VA, USA. She is an assistant professor in the Halmos College of Natural Sciences and Oceanography’s Department of Mathematics. Her current research interests include discrete mathematics, matrix analysis, algebraic graph theory, and combinatorial matrix theory.

About the Series
Hosted by NSU’s Halmos College of Natural Sciences and Oceanography Department of Mathematics, the Mathematics Colloquium Series aims to increase awareness of the importance of mathematics and applications in daily life. The series also gives mathematics faculty members and students the opportunity to discuss independent research and share their passion for the subject. For more information, contact Jeffrey W. Lyons, Ph.D., associate professor, at (954) 262-7931.