Linear time algorithm to check the singularity of block graphs

Ranveer Singh, Naomi Shaked-Monderer, Avi Berman

A block graph is a graph in which every block is a complete graph. Let $G$ be a block graph and let $A(G)$ be its (0,1)-adjacency matrix. Graph $G$ is called nonsingular (singular)…