Invertibility of graphs with a unique perfect matching
Combinatorics
2016-12-08 v1
Abstract
In this paper we investigate invertibility of graphs with a unique perfect matching, i.e. graphs having a unique 1-factor. We recall the new notion of the so-called negatively invertible graphs investigated by the authors in the recent paper. It is an extension of the classical definition of an inverse graph due to Godsil. We characterize all graphs with a unique perfect matching on vertices with respect to their positive and negative invertibility. We show that negatively invertible graphs exhibit properties like selfinvertibility which cannot be observed within the class of positively invertible non-bipartite graphs with a unique perfect matching.
Keywords
Cite
@article{arxiv.1612.02234,
title = {Invertibility of graphs with a unique perfect matching},
author = {Sona Pavlikova and Daniel Sevcovic},
journal= {arXiv preprint arXiv:1612.02234},
year = {2016}
}