Graph Invertibility |
| |
Authors: | Cam McLeman Erin McNicholas |
| |
Institution: | 1. Department of Mathematics, The University of Michigan-Flint, 303 E. Kearsley Street, Flint, MI, 48502, USA 2. Department of Mathematics, Willamette University, 900 State Street, Salem, OR, 97301, USA
|
| |
Abstract: | 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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|