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: | Wu Tingzeng, Dong Xiangshuai |
|---|---|
| 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!
|
Similar Items
-
Optimal L(3,2,1)-labeling of trees
by: Xiaoling Zhang
Published: (2024-09-01) -
Brouwer's conjecture for the sum of the k largest Laplacian eigenvalues of some graphs
by: Wang Ke, et al.
Published: (2024-10-01) -
A Laplacian eigenbasis for threshold graphs
by: Macharete Rafael R., et al.
Published: (2024-10-01) -
Measurable Vizing’s theorem
by: Jan Grebík
Published: (2025-01-01) -
On the spectral radius and energy of the degree distance matrix of a connected graph
by: Khan Zia Ullah, et al.
Published: (2025-04-01)