| |
| | IngentaConnect A Combinatorial Laplacian with Vertex Weights (Site not responding. Last check: 2007-10-27) |
 | | One of the classical results in graph theory is the matrix-tree theorem which asserts that the determinant of a cofactor of the combinatorial Laplacian is equal to the number of spanning trees in a graph (see [1, 17, 11, 15]). |
 | | Namely, a Laplacian ℒ for G is a matrix with rows and columns indexed by the vertex set V of G, and the (u, v)-entry of ℒ, for u, v in G, u≠ v, is associated with the edge-weight of the edge (u, v). |
 | | In this note, we consider a vertex weighted Laplacian which is motivated by a problem arising in the study of algebro-geometric aspects of the Bethe Ansatz [18]. |
| www.ingentaconnect.com /content/ap/ta/1996/00000075/00000002/art00080 (309 words) |
|