Diagonal Entry Restrictions in Minimum Rank Matrices, and the Inverse Inertia and Eigenvalue Problems for Graphs
Let F be a field, let G be an undirected graph on n vertices, and let SF(G) be the set of all F-valued symmetric n x n matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of G. Let MRF(G) be defined as the set of matrices in SF(G) whose rank achieves...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
BYU ScholarsArchive
2012
|
| Subjects: | |
| Online Access: | https://scholarsarchive.byu.edu/etd/3246 https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=4245&context=etd |