Date Thesis Awarded
5-2008
Access Type
Honors Thesis -- Access Restricted On-Campus Only
Degree Name
Bachelors of Science (BS)
Department
Mathematics
Advisor
Charles R. Johnson
Committee Members
John Morreall
Leiba Rodman
George Rublein
Abstract
Our ultimate goal is to find the possible eigenvalue multiplicity lists which can occur among Hermitian matrices whose graph is a given tree (no restriction is placed on diagonal entries). We expand the implicit construction method pioneered by Johnson et al. to find all multiplicity lists for binary, diametric, depth-one trees, as well as provide an upper bound for the minimum number of 1's among multiplicity lists for a given tree.
Recommended Citation
Nuckols, Jonathan, "Trees and the Implicit Construction of Eigenvalue Multiplicities" (2008). Undergraduate Honors Theses. William & Mary. Paper 827.
https://scholarworks.wm.edu/honorstheses/827
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 License.
Comments
Thesis is part of Honors ETD pilot project, 2008-2013. Migrated from Dspace in 2016.