Graph Invertibility

Details Graph Invertibility Graph Invertibility

2011-08-17

arxiv.org/abs/1108.3588v1

Mathematics

Combinatorics

18 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Graph Invertibility does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Graph Invertibility, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Graph Invertibility will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-180419