Breadcrumb
Modeling Spectral Degeneracy and Structure in Graphs
Presentation Year
2026
College or Department
College of Natural Resources & Sciences
Short Description of your Research or Creative Project (700 characters or less)
Graph spectrum is not canonized under isomorphism. Finding an algorithm that rates whether a graph is spectrally determined is currently unsolvable in polynomial time. A total classification for spectrally-determined graphs is necessary to address complex networking and ranking problems. Heat map visualization and matrix computation algorithms were utilized to detect obscure structural variations. Evidently, cases of cospectral matches depend on lapses in complete bipartite spectral degeneracy. Results support Haemers’ conjecture that almost all graphs are spectrally determined. Future research may utilize alternative matrix representations to encode complex structural properties.
Permission to Publish Work
Yes
Presentation File Upload
Primary Contact: First Name
Sophia
Primary Contact: Last Name
Bauer
Primary Contact: Email
sab246@humboldt.edu
Primary Contact: I am a
Undergraduate Student
Primary Contact: Phone Number
7072062677
Indicate File Dimensions
4'x3'