Nonsingular (vertex-weighted) block graphs (Q2185844)

A graph is non-singular if its adjacency matrix is non-singular. In this nicely-written article, the authors consider the non-singularity of block graphs -- these are graphs whose blocks each are cliques -- and of the more general vertex-weighted block graphs. Necessary and sufficient conditions for a vertex-weighted block graph to be non-singular are given, in terms of edge contracted minors. It is also shown that replacing blocks by paths of even order does not change a block graph's non-singularity. These results are used to prove the non-singularity of several infinite families of graphs, and many interesting smaller results are also given. Together, the results of this article extend and sometimes re-prove the results on non-singular graphs that have accumulated since 1957, when \textit{L. Collatz} and \textit{U. Sinogowitz} [Abh. Math. Semin. Univ. Hamb. 21, 63--77 (1957; Zbl 0077.36704)] first suggested investigating this topic.