2016/12/07 by Soña Pavlíková, Pavlikova, Sona, Daniel Ševčovič +1
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Graph theory and applications #Primary 05C50 #Secondary 15A09
paper · pdf · doi:10.48550/arxiv.1612.02234
openalex publication_date 2016/12/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 m≤ 6 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.