A finite group attached to the laplacian of a graph (Q1182864)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A finite group attached to the laplacian of a graph |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A finite group attached to the laplacian of a graph |
scientific article |
Statements
A finite group attached to the laplacian of a graph (English)
0 references
28 June 1992
0 references
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.
0 references
finite group
0 references
laplacian of a graph
0 references
spanning trees
0 references
