Computing the permanent of the Laplacian matrices of nonbipartite graphs (Q2230052)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7396525
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing the permanent of the Laplacian matrices of nonbipartite graphs |
scientific article; zbMATH DE number 7396525 |
Statements
Computing the permanent of the Laplacian matrices of nonbipartite graphs (English)
0 references
17 September 2021
0 references
Summary: Let \(G\) be a graph with Laplacian matrix \(L(G)\). Denote by \(\text{per }L(G)\) the permanent of \(L(G)\). In this study, we investigate the problem of computing the permanent of the Laplacian matrix of nonbipartite graphs. We show that the permanent of the Laplacian matrix of some classes of nonbipartite graphs can be formulated as the composite of the determinants of two matrices related to those Laplacian matrices. In addition, some recursion formulas on per \(L(G)\) are deduced.
0 references
0.8562881946563721
0 references
0.8338383436203003
0 references
0.8229125738143921
0 references
0.8215842247009277
0 references
