Inverses of bipartite graphs (Q1715079): Difference between revisions

Let $G$ be a bipartite graph with adjacency matrix $A$. If $G$ has a unique perfect matching, then $A$ has an inverse $A^{-1}$ which is a symmetric integral matrix, and hence the adjacency matrix of a multigraph. The inverses of bipartite graphs with unique perfect matchings have a strong connection to Möbius functions of posets. In this note, the authors characterize all bipartite graphs with a unique perfect matching whose adjacency matrices have inverses diagonally similar to non-negative matrices, which settles an open problem of \textit{C. D. Godsil} [Combinatorica 5, 33--39 (1985; Zbl 0578.05049)]. The paper contains no applications despite there are many applications for bipartite graphs.