DisCoMath Seminar: Rigid Linkages and Eigenvalues
Discrete & Computational Math Seminar (DisCoMath)
Rigid Linkages and Eigenvalues
Dr. Shahla Nasserasr
School of Mathematical Sciences, RIT
Given an assignment of colours blue and white to the vertices of graph G, the zero forcing rule determines a subset of white vertices to be re-coloured blue. The zero forcing process applies this rule in discrete time-steps until no more changes are possible. Rigid linkage forcing is defined similarly to the standard zero forcing process. Rigid linkages are used to provide more information on the multiplicities of the eigenvalues, and the relationship between the eigenvalues of matrices related to graphs. In this talk, some properties and applications of the rigid linkage forcing process will be discussed.
Dr. Nasserasr is an Assistant Professor in the School of Mathematical Sciences at RIT. She received her Ph.D. in matrix analysis from the College of William and Mary in 2010. Prior to joining RIT in 2020, she was an Associate Professor of Mathematics at Brandon University, Canada. Dr. Nasserasr’s research interests include combinatorial matrix theory, inverse eigenvalue problem, totally positive matrices, and graph theory.
Undergraduates, graduates, and experts. Those with interest in the topic.
When and Where
This is an RIT Only Event