On the structure of the inverse of non-singular unicyclic graphs

Abstract

Let U be a non-singular unicyclic graph. We show that the inverse of the adjacency matrix of U has a combinatorial description in terms of maximum matchings of U.