Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Entire DC Network
The Minimum Rank, Inverse Inertia, And Inverse Eigenvalue Problems For Graphs, Mark Condie Kempton
The Minimum Rank, Inverse Inertia, And Inverse Eigenvalue Problems For Graphs, Mark Condie Kempton
Theses and Dissertations
For a graph G we define S(G) to be the set of all real symmetric n by n matrices whose off-diagonal zero/nonzero pattern is described by G. We show how to compute the minimum rank of all matrices in S(G) for a class of graphs called outerplanar graphs. In addition, we obtain results on the possible eigenvalues and possible inertias of matrices in S(G) for certain classes of graph G. We also obtain results concerning the relationship between two graph parameters, the zero forcing number and the path cover number, related to the minimum rank problem.