Almost self-inverse graphs

Authors

R. B. Bapat, Indian Statistical Institute (Delhi Centre)
S. K. Panda, Technion - Israel Institute of Technology

Article Type

Research Article

Publication Title

Linear and Multilinear Algebra

Abstract

Let G be a simple graph with adjacency matrix A(G). The inverse of the graph G, when it exists, is the unique weighted graph whose adjacency matrix is similar to A(G)-1 via a particular type of similarity. An invertible graph G is said to be an almost self-inverse graph if the inverse graph of G can be obtained from G just by joining two nonadjacent vertices. We present a characterization of almost self-inverse graphs of a specific class of graphs which contains the class of nonsingular trees.

First Page

2065

Last Page

2076

DOI

10.1080/03081087.2018.1481357

Publication Date

10-3-2019

Recommended Citation

Bapat, R. B. and Panda, S. K., "Almost self-inverse graphs" (2019). Journal Articles. 661.
https://digitalcommons.isical.ac.in/journal-articles/661