Date Thesis Awarded
Honors Thesis -- Open Access
Bachelors of Science (BS)
Charles R. Johnson
Given a certain tree, we explore what we can infer about the eigenvalue multiplicities for a Hermitian matrix whose graph is that tree solely from the tree itself. Topics include the minimum number of 1's among the possible multiplicity lists and the effects of edge subdivision and vertex deletion in the tree on the possibly multiplicity lists. We also begin to explore what we can infer about the eigenvalue multiplicity lists of Hermitian matrices whose graph is a certain non-tree from what we already know about trees.
McMichael, Paul, "Multiplicity Lists for Classes of Hermitian Matrices whose Graph is a Certain Tree" (2008). Undergraduate Honors Theses. Paper 826.
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 License.