This thesis is separated into two parts: threshold graphs and inertia sets. First we present an algorithmic approach to finding the minimum rank of threshold graphs and then progress to counting the number of threshold graphs with a specific minimum rank. Second, we find an algorithmic and more automated way of determining the inertia set of graphs with seven or fewer vertices using theorems and lemmata found in previous papers. Inertia sets are a relaxation of the inverse eigenvalue problem. Instead of determining all the possible eigenvalues that can be obtained by matrices with a specific zero/nonzero pattern we restrict to counting the number of positive and negative eigenvalues.
| Identifer | oai:union.ndltd.org:BGMYU2/oai:scholarsarchive.byu.edu:etd-4846 |
| Date | 17 December 2013 |
| Creators | Guzman, Christopher Abraham |
| Publisher | BYU ScholarsArchive |
| Source Sets | Brigham Young University |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | Theses and Dissertations |
| Rights | http://lib.byu.edu/about/copyright/ |
Page generated in 0.0018 seconds