Extremal Permanents of Laplacian Matrices of Unicyclic Graphs
The extremal problem of Laplacian permanents of graphs is a classical and challenging topic in algebraic combinatorics, where the inherent #P-complete complexity of permanent computation renders this pursuit particularly intractable. In this paper, we determine the upper and lower bounds of permanen...
Сохранить в:
| Главные авторы: | , , |
|---|---|
| Формат: | Artigo |
| Язык: | Inglês |
| Опубликовано: |
MDPI AG
2025-07-01
|
| Серии: | Axioms |
| Предметы: | |
| Online-ссылка: | https://www.mdpi.com/2075-1680/14/8/565 |
| Метки: |
Нет меток, Требуется 1-ая метка записи!
|