Spectral Invariants of Graphs and Their Applications to Combinatorics Conference Abstracts
| Conference |
"Symmetries of Discrete Objects" 12-16 Feb 2024 , Auckland |
||||
|---|---|---|---|---|---|
| Source | Abstracts of the conference 'Symmetries of Discrete Objects" Compilation, 2024. |
||||
| Output data | Year: 2024, Pages: 21 Pages count : 1 | ||||
| Authors |
|
||||
| Affiliations |
|
Abstract:
In this presentation we investigate the infinite family of circulant graphs C_n(s_1, s_2, ..., s_k). We present an explicit formula for the number of spanning trees, rooted spanning forests and the Kirchhoff index for this family of graphs. Then we investigate arithmetical and asymptotic properties of the obtained numbers. All formulas are given in terms of the Chebyshev polynomials.
Cite:
Mednykh A.D.
Spectral Invariants of Graphs and Their Applications to Combinatorics
In compilation Abstracts of the conference 'Symmetries of Discrete Objects". 2024. – C.21.
Spectral Invariants of Graphs and Their Applications to Combinatorics
In compilation Abstracts of the conference 'Symmetries of Discrete Objects". 2024. – C.21.
Dates:
| Published print: | Feb 15, 2024 |
| Published online: | Feb 15, 2024 |
Identifiers:
No identifiers
Citing:
Пока нет цитирований