The Method of Graph for Solving the Inverse Matrix of A Class Invertible Matrix
Delong Zhang · Shuxue de shijian yu renshi · 2004
Let M(G) be the incident matrix of a simply undirected graph. Let γ(A) denote the number of nonzero entries in the inverse of an invertible submatrix A of M(G). In this paper, we first obtain a simple and effective method for solving the inverse of an invertible submatrix of M(G), then we obtain the tight upper and lower bounds of γ(A), meanwhile all extreme submatrice which reach bounds are characterized.