Further results on permanents of Laplacian matrices of trees
The research on the permanents of graph matrices is one of the contemporary research topic in algebraic combinatorics. Brualdi and Goldwasser characterized the upper and lower bounds of permanents of Laplacian matrices of trees. In this article, we determined the second and third minimal permanents...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2025-08-01
|
| Series: | Open Mathematics |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/math-2025-0185 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The research on the permanents of graph matrices is one of the contemporary research topic in algebraic combinatorics. Brualdi and Goldwasser characterized the upper and lower bounds of permanents of Laplacian matrices of trees. In this article, we determined the second and third minimal permanents of the Laplacian matrices of trees, and the second maximal permanent of the Laplacian matrices of trees is given. The corresponding extremal graphs are characterized. Furthermore, we determined bounds of permanents of the Laplacian matrices of non-caterpillar trees with given graph parameters. Moreover, the corresponding extremal graphs are determined. |
|---|---|
| ISSN: | 2391-5455 |