Loading...
Trees and the Implicit Construction of Eigenvalue Multiplicities
Nuckols, Jonathan
Nuckols, Jonathan
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.
Description
Thesis is part of Honors ETD pilot project, 2008-2013. Migrated from Dspace in 2016.
Date
2008-05-13
Journal Title
Journal ISSN
Volume Title
Publisher
Collections
Download Dataset
Rights Holder
Usage License
Embargo
Research Projects
Organizational Units
Journal Issue
Keywords
Eigenvalue, Graph, Matrix
Citation
Department
Mathematics