Description
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.
Date of Event
November 15, 2016 from 12:00 PM - 1:00 PM
Location
Mailman-Hollywood Auditorium 2nd Floor
NSU News Release Link
https://nsunews.nova.edu/next-math-colloquium-series-talk-to-explore-new-results-about-qg/
Included in
Minimum Number of Distinct Eigenvalues of Graphs
Mailman-Hollywood Auditorium 2nd Floor
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.
https://nsuworks.nova.edu/mathematics_colloquium/ay_2016-2017/events/1
Presenter Bio
Dr. 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 of Mathematics at Nova Southeastern University. Her current research interests include algebraic graph theory and combinatorial matrix theory.