Spectral Invariants of Graphs and Their Applications to Combinatorics - Доклады на конференциях | Sciact - Система учета научной деятельности ИМ СО РАН

Spectral Invariants of Graphs and Their Applications to Combinatorics Доклады на конференциях

Язык

Английский

Тип доклада

Секционный

Конференция

"Symmetries of Discrete Objects"
12-16 февр. 2024 , Auckland

Авторы

Медных Александр Дмитриевич ^1,2

Организации

1	Институт математики им. С.Л. Соболева СО РАН
2	Новосибирский государственный университет

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.

Mednykh A.D.
Spectral Invariants of Graphs and Their Applications to Combinatorics
"Symmetries of Discrete Objects" 12-16 Feb 2024