Date Thesis Awarded

5-2008

Document Type

Honors Thesis

Degree Name

Bachelors of Science (BS)

Department

Mathematics

Advisor

Charles R. Johnson

Committee Member

Marc Sher

Committee Member

Ilya Spitkovsky

Abstract

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.

Creative Commons License

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.

Share

COinS