A bound for the permanent of the Laplacian matrix (Q1072613)
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 bound for the permanent of the Laplacian matrix |
scientific article; zbMATH DE number 3941712
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A bound for the permanent of the Laplacian matrix |
scientific article; zbMATH DE number 3941712 |
Statements
A bound for the permanent of the Laplacian matrix (English)
0 references
1986
0 references
Let L(G) be D-A where D is the diagonal matrix of vertex degrees and A the adjacency matrix. The author proves by an explicit formula that the permanent of L is at least 2(n-1)k where k, the complexity, is the number of spanning trees.
0 references
simple connected graph
0 references
permanent
0 references
Laplacian matrix
0 references
complexity
0 references
