On the adjacency matrix of a block graph

Abstract

A block graph is a graph in which every block is a complete graph. Let be a block graph and let be the adjacency matrix of . We first obtain a formula for the determinant of over reals. It is shown that is nonsingular over if and only if the removal of any vertex from produces a graph with exactly one odd component. A formula for the inverse of over is obtained, whenever it exists. We obtain some results for the adjacency matrices over , of claw-free block graphs, which are the same as the line graphs of trees, and for the adjacency matrices of flowers, which are block graphs with only one cut-vertex.