On graphs with signed inverses
Authors:
Abstract
A graph G is called invertible if its adjacency matrix A has an inverse which is the adjacency matrix of some graph H. All such graphs were shown by Harary and Minc to have the form nK2. We now introduce signed invertible (or briefly s‐invertible) graphs G as those whose inverse H is a signed graph. We identify two infinite classes of s‐invertible graphs: the paths P2n of even order, and the corona of any graph with K1. We then characterize s‐invertible trees.Keywords
This publication has 5 references indexed in Scilit:
- Which Nonnegative Matrices Are Self-Inverse?Mathematics Magazine, 1976
- Which Nonnegative Matrices are Self-Inverse?Mathematics Magazine, 1976
- GRAPH THEORY1969
- The Determinant of the Adjacency Matrix of a GraphSIAM Review, 1962
- On the notion of balance of a signed graph.Michigan Mathematical Journal, 1953