Extending the work of Godsil and others, we investigate the notion of the inverse of a graph (specifically, of bipartite graphs with a unique perfect matching). We provide a concise necessary and sufficient condition for the invertibility of such graphs and generalize the notion of invertibility to multigraphs. We examine the question of whether there exists a “litmus subgraph” whose bipartiteness determines invertibility. As an application of our invertibility criteria, we quickly describe all invertible unicyclic graphs. Finally, we describe a general combinatorial procedure for iteratively constructing invertible graphs, giving rise to large new families of such graphs.
KeywordsInverse graph Unique perfect matching Digraph Transitive closure Unicyclic graph
Unable to display preview. Download preview PDF.
- 1.Harary, F., Minc H.: Which nonnegative matrices are self-inverse? Math. Mag. (Mathematical Association of America) 49(2), 91–92 (1976)Google Scholar
- 5.Aigner, M.: Combinatorial Theory. Springer, New York (1979)Google Scholar
- 6.Speyer, D.: Partitions into 0,1, and 2 with a partial sum condition. http://mathoverflow.net/questions/64802 (version: 12th May 2011)
- 8.The on-line Encyclopedia of integer sequences, published electronically at http://oeis.org/wiki/Welcome#Referencing_the_OEIS, (2011). Sequence A001006