## 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.

PAVLÍKOVÁ Soňa/SK, and ŠEVČOVIČ Daniel/SKInvertibility of graphs with a unique perfect matching1.2

Primary 05C50; Secondary 15A09

## 1 Introduction and preliminaries

The main purpose of this paper is to investigate invertibility of graphs with a unique perfect matching (graphs having a unique 1-factor) (c.f. Pavlíková *et al.* [10, 9]). Following our recent paper [12], we recall the new notion of the so-called negatively invertible graphs. It is an extension of the classical definition of an inverse graph due to Godsil [4]. Our goal is to characterize all graphs with a unique perfect matching on vertices with respect to their positive and negative invertibility.

According to the result due to Sachs (c.f. [2, p. 32]), it is known that, for a bipartite graph having a unique perfect matching, the adjacency matrix is integrally invertible. The aim of this paper is to investigate a larger class of graphs which are not necessarily bipartite but still have a unique 1-factor and an integrally invertible adjacency matrix.

Let be an undirected graph with the set of vertices and the set of edges . By we denote its adjacency matrix. Conversely, if is a -symmetric matrix then denotes the graph with the adjacency matrix . The spectrum of an undirected graph consists of eigenvalues of its adjacency symmetric matrix , i.e. is an eigenvalue of (c.f. [3, 2]). If the spectrum does not contain zero then the adjacency matrix is invertible.

Clearly, a graph has the integral inverse matrix if and only if the determinant (c.f. Kirkland and Akbari [6]). The inverse matrix however may contain positive as well as negative entries. In fact, it is well known that the inverse matrix of the adjacency matrix of a graph is nonnegative if and only if the graph is a union of isolated edges (c.f. Harary [5]). Nevertheless, the concept of an inverse graph is indeed based on the inverse of its adjacency matrix. In [4] Godsil defined a graph to be invertible if the inverse of its (non-singular) adjacency matrix is diagonally similar (c.f. [13]) to a non-negative matrix.

###### Definition 1 (Godsil [4])

An undirected vertex-labeled graph is called positively invertible (or invertible in Godsil’s sense) if inverse of its adjacency matrix is signable to a nonnegative integer matrix, i.e. there exists a diagonal matrix containing elements and such that all elements of the matrix are nonnegative integers only. The inverse graph is defined by the adjacency matrix .

Unfortunately, the class of positively invertible graphs does not contain many important examples of graphs having integral inverse matrix. Among them there is a graph representing the chemical organic molecule of fulvene (see Fig. 1). The inverse of its adjacency matrix is integral but it is not signable to a nonnegative matrix.

The structural graph of fulvene however plays an important role in computational chemistry as it represents a chemical molecule. For instance, spectral properties of inverse graphs are important in order to compute the so-called binding energies of molecular orbitals.

Motivated by this shortcoming of positive invertibility of a graph, in the recent paper [12], Pavlíková and Ševčovič introduced the new concept of the so-called negative invertibility of a graph with integral inverse of its adjacency matrix.

###### Definition 2 (Pavlíková and Ševčovič [12])

An undirected vertex-labeled graph is called negative invertible if the inverse matrix of its adjacency matrix is signable to a nonpositive integer matrix, i.e. there exists a diagonal matrix containing elements and such that all elements of the matrix are nonpositive integers only. The inverse graph is defined by the adjacency matrix .

The adjacency matrix of the fulvene graph and its inverse matrix are as follows:

The matrix is signable to a nonpositive matrix by the diagonal matrix .

Both positive as well as negatively invertible graphs have the following useful property. If is positively invertible then is the adjacency matrix of the inverse graph . As we have the identity . This property also remains true in the case of negatively invertible graphs. Indeed, if is negatively invertible then is the adjacency matrix of the inverse graph . As we again obtain .

In the next section we recall the complete list of graphs with a unique perfect matching on vertices discovered by Pavlíková and Ševčovič [12]. In addition, we present their inverse graphs and maximal subgraphs with a unique perfect matching. Interestingly enough, there are no positively invertible non-bipartite graphs with a unique perfect matching that are selfinvertible. On the other hand, there exist two negatively invertible graphs which are selfinvertible.

## 2 Connected graphs with a unique 1-factor

In this section we present the complete list of invertible graphs on vertices with a unique 1-factor. Recall that a graph has a unique 1-factor if there exists a unique subgraph spanning and such that each vertex has the degree . Notice that any graph having a 1-factor should have even number of vertices.

For the graph is the unique connected graph and it has a unique 1-factor. It is a positively and negatively invertible bipartite graph.

For there are two connected graphs with a unique 1-factor shown in Fig. 2. The graph is bipartite and selfinvertible. The graph is positively invertible but it is not selfinvertible.

Next we analyse the connected graphs on vertices with a unique -factor. We have the following theorem.

###### Theorem 1

[12] There exist 20 undirected connected graphs on vertices with a unique 1-factor shown in Figures 3,4,5,6,7. All of them have invertible adjacency matrices. Except of the graph they are integrally invertible.

There are three bipartite graphs , and which are simultaneously positively and negatively invertible. There are twelve graphs

which are positively invertible. The three graphs , and are negatively invertible. The integrally invertible graph is neither positively nor negatively invertible. The graphs , and are iso-spectral but not isomorphic.

Recall that the proof of this result is based on the well-known Kotzig’s theorem. It states that a graph with a unique 1-factor should contain a bridge belonging to the 1-factor sub-graph. Using this characterization one can construct all 20 connected graphs on 6 vertices having a unique 1-factor. We refer the reader to [12] for details.

Graph | invertibility |
---|---|

positively and negatively invertible (bipartite) | |

positively and negatively invertible (bipartite) | |

positively invertible | |

positively invertible | |

negatively invertible | |

positively and negatively invertible (bipartite) | |

positively invertible | |

positively invertible | |

positively invertible | |

negatively invertible | |

noninvertible with integral inverse of the adjacency matrix | |

negatively invertible | |

positively invertible | |

positively invertible | |

positively invertible | |

positively invertible | |

positively invertible | |

positively invertible | |

noninvertible with nonintegral inverse of the adjacency matrix | |

positively invertible |

### 2.1 Positively and negatively invertible (bipartite) graphs with a unique perfect matching on vertices

Recall that a graph is called bipartite if the set of vertices can be divided into two disjoint subsets such that every edge connects a vertex from the first subset into the one from the second subset.

###### Theorem 2 (Pavlíková and Ševčovič [12])

Let be an integrally invertible graph. Then is a bipartite graph if and only if is simultaneously positively and negatively invertible.

In [8] McLeman and McNicholas considered graphs which can be obtained from a given connected graph by attaching pendant edges to each of vertices. They proved that such graphs are selfinvertible, i.e. . An example illustrating their result is the graph which is obtained from a path with three vertices by adding pendant edges to each of them.

In Fig. 3 we show all three bipartite graphs on vertices with a unique perfect matching. According to the previous theorem they are simultaneously positive as well as negative invertible.

### 2.2 Positively invertible graphs with a unique perfect matching on vertices

In this section we present the complete list of twelve non-bipartite graphs with a unique perfect matching on vertices which are positively invariant (see Fig. 4,5). Interestingly, none of them is selfinvertible and their inverse graphs contain vertices with loops with even multiplicity. The inverse graphs contain multiple edges. There are four graphs denoted by , and such that they are maximal subgraphs of their inverse graphs, i.e. . There are two pairs of graphs such that and for pairs .

### 2.3 Negatively invertible graphs with a unique perfect matching on vertices

In this section we present the complete list of all three non-bipartite graphs with a unique perfect matching on vertices which are negatively invariant. The graphs , and are selfinvertible. Recall that according to the results due to McLeman and McNicholas [8] a graph which is obtained from a given connected graph by attaching pendant edges to each of vertices is selfinvertible. Among negatively invertible graphs with unique perfect matching on vertices as an example illustrating this property one can present the graph . In contrast to positively invertible bipartite graphs there exists the graph which is selfinvertible but it cannot be obtained by means of the construction due to McLeman and McNicholas.

### 2.4 Noninvertible graphs with a unique perfect matching on vertices

In this section we present two remaining graphs on vertices which are not invertible. The first graph is denoted by and it has the adjacency matrix which is integrally invertible. Nevertheless, is neither positively nor negatively signable, so is not invertible. The graph has the adjacency matrix with and, as a consequence, is not integer matrix. Hence is noninvertible as well.

## 3 Conclusions

In this note we investigated invertible graphs with a unique perfect matching on vertices. We recalled classical concept of graph inversion due to Godsil which we referred to as positive invertibility of a graph. We also recalled the new concept of negative invertibility proposed by the authors in [12]. By inspecting properties of the inverse graphs we showed that negatively invertible graphs exhibits properties like selfinvertibility which cannot be observed within the class of positively invertible non-bipartite graphs with a unique perfect matching on vertices.

## Acknowledgements

The research was supported by the APVV Research Grant 0136-12 (SP) and VEGA grant 1/0780/15 (DŠ).

## Current address

Pavlíková Soňa, RNDr., CSc.

Institute of Information Engineering, Automation, and Mathematics, FCFT, Slovak Technical University, 812 37 Bratislava, Slovak republic

sona.pavlikova@stuba.sk

Ševčovič Daniel, Prof., RNDr., CSc.

Institute of Mathematics and Physics, Faculty of Mechanical Engineering, Slovak University of Technology in Bratislava, Nám. slobody 17, 812 31 Bratislava, Slovak republic

sevcovic@fmph.uniba.sk

### References

- R. B. Bapat, and E. Ghorbani, Inverses of triangular matrices and bipartite graphs, Linear Algebra and its Applications 447 (2014), 68-73.
- D. Cvetković, M. Doob, and H. Sachs, Spectra of graphs - Theory and application, Deutscher Verlag der Wissenchaften, Berlin, 1980; Academic Press, New York, 1980.
- D. Cvetković, I. Gutman, and S. Simić, On selfpseudo-inverse graphs, Univ. Beograd Publ. Elektrotehn. Fak. Ser. Mat. fiz., No. 602 – 633, (1978), 111–117.
- C. D. Godsil, Inverses of Trees, Combinatorica 5 (1985) 1, 33–39.
- F. Harary, and H. Minc, Which nonnegative matrices are self-inverse? Math. Mag. (Math. Assoc. of America) 49 (1976) 2, 91–92.
- S. J. Kirkland, and S. Akbari, On unimodular graphs, Linear Algebra and its Applications 421 (2007), 3–15.
- S. J. Kirkland, and R. M. Tifenbach, Directed intervals and the dual of a graph, Linear Algebra and its Applications 431 (2009), 792–807.
- C. McLeman, and E. McNicholas, Graph Invertibility, Graphs and Combinatorics (2014) 30, 977-1002
- S. Pavlíková, Graphs with a unique -factor and matrices, PhD Thesis (in Slovak), Comenius University, Bratislava, 1994, www.iam.fmph.uniba.sk/studium/phd/pavlikova
- S. Pavlíková, and J. Krč-Jediný, On the inverse and dual index of a tree, Linear and Multilinear Algebra 28 (1990), 93–109.
- S. Pavlíková, A note on inverses of labeled graphs. to appear: Australasian Journal on Combinatorics 2016.
- S. Pavlíková, and D.Ševčovič, On a Construction of Integrally Invertible Graphs and their Spectral Properties, submitted, 2016.
- T. Zaslavsky, Signed graphs, Discrete Applied Math. 4 (1982), 47–74.