Unicyclic graphs with bicyclic inverses

Article Type

Research Article

Publication Title

Czechoslovak Mathematical Journal

Abstract

A graph is nonsingular if its adjacency matrix A(G) is nonsingular. The inverse of a nonsingular graph G is a graph whose adjacency matrix is similar to A(G)−1 via a particular type of similarity. Let H denote the class of connected bipartite graphs with unique perfect matchings. Tifenbach and Kirkland (2009) characterized the unicyclic graphs in H which possess unicyclic inverses. We present a characterization of unicyclic graphs in H which possess bicyclic inverses.

First Page

1133

Last Page

1143

DOI

10.21136/CMJ.2017.0429-16

Publication Date

12-1-2017

Comments

Open Access, Green

This document is currently not available here.

Share

COinS