A finite group attached to the laplacian of a graph (Q1182864)

The laplacian of a graph is the difference of the diagonal matrix giving the degrees of vertices and the adjacency matrix. The group in question is in effect the torsion part of the cokernel of the mapping on \(Z^ n\) induced by the laplacian. The author classifies graphs where its minimum number of cyclic generators is \(n-1\) or \(n-2\) and describes how the group changes when each edge of a graph is divided into \(k\) edges.