Computing the permanent of the Laplacian matrices of nonbipartite graphs (Q2230052): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1155/2021/6621029 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3174550048 / rank | |||
Normal rank | |||
Revision as of 18:45, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the permanent of the Laplacian matrices of nonbipartite graphs |
scientific article |
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
