Nonsingular Block Graphs: An Open Problem

03/11/2018

∙

by   Ranveer Singh, et al.

∙

0

∙

share

A block graph is a graph in which every block is a complete graph (clique). Let G be a block graph and let A(G) be its (0,1)-adjacency matrix. Graph G is called nonsingular (singular) if A(G) is nonsingular (singular). Characterizing nonsingular block graphs, other than trees, is an interesting open problem. In this article, we give some classes of nonsingular and singular block graphs and related conjectures.