摘要：The inverse of a graph has been studied for over 40 years. In this talk, various definitions on inverses of graphs are introduced, with emphasis being placed on inverses on bipartite graphs with unique perfect matchings. We give a complete characterization to the invertible bipartite graphs with unique perfecting matchings, which solves an open problem of Godsil.
