Inverse Eigenvalue Problem for Graphs (IEPG) on Six Vertices

June 2017 – July 2017

In the summer between my Sophomore and Junior year, I participated in an NSF funded Research Experience for Undergraduates (REU) at Iowa State University (ISU). I was in one of two REU teams researching math at ISU, working under the direction of Dr. Steve Butler. Our project was on the Inverse Eigenvalue Problem for Graphs (IEPG), which has long been a focus of study at ISU. We solved the problem for graphs on six vertices, and discovered a particular restriction on classifying the complete bipartite graph where each vertex group has at least three elements. I got to know the nine other undergraduates at the REU well, as we worked on our individual projects and met together to learn about applying to and succeeding in graduate school.

To learn about this research, please read our paper, Ordered multiplicity inverse eigenvalue problem for graphs on six vertices (submitted).

I gave an oral presentations on this research at:
Agnes Scott College Spring Annual Research Conference, Atlanta, GA, April 2018

I gave poster presentations on this research at:
International Linear Algebra Society meeting, Ames, IA, July 2017
Joint Mathematics Meeting, San Diego, CA, January 2018