Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Entire DC Network
Diagonal Entry Restrictions In Minimum Rank Matrices, And The Inverse Inertia And Eigenvalue Problems For Graphs, Curtis G. Nelson
Diagonal Entry Restrictions In Minimum Rank Matrices, And The Inverse Inertia And Eigenvalue Problems For Graphs, Curtis G. Nelson
Theses and Dissertations
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 the minimum of the ranks of matrices in SF(G). We develop techniques involving Z-hat, a process termed nil forcing, and induced subgraphs, that can determine when diagonal entries corresponding to specific vertices of G must be zero or nonzero for all matrices in …