Computing the Permanent of the Laplacian Matrices of Nonbipartite Graphs

Xiaoxue Hu, Grace Kalaso and Francisco Balibrea

Journal of Mathematics, 2021, vol. 2021, 1-4

Abstract: Let G be a graph with Laplacian matrix LG. Denote by per LG the permanent of LG. 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 LG are deduced.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2021/6621029.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2021/6621029.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:6621029

DOI: 10.1155/2021/6621029

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().