Computing the Permanent of the Laplacian Matrices of Nonbipartite Graphs
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 formu...
Saved in:
| Main Authors: | Xiaoxue Hu, Grace Kalaso |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2021/6621029 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Further results on permanents of Laplacian matrices of trees
by: Wu Tingzeng, et al.
Published: (2025-08-01) -
Incidence and Laplacian matrices of wheel graphs and their inverses
by: Jerad Ipsen, et al.
Published: (2023-07-01) -
On the Eigenvalues and Energy of the Seidel and Seidel Laplacian Matrices of Graphs
by: J. Askari, et al.
Published: (2024-01-01) -
On Path Laplacian Eigenvalues and Path Laplacian Energy of Graphs
by: Shridhar Chandrakant Patekar, et al.
Published: (2018-01-01) -
On the Adjacency, Laplacian, and Signless Laplacian Spectrum of Coalescence of Complete Graphs
by: S. R. Jog, et al.
Published: (2016-01-01)