I. A. Mednykh

1. The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic
   2017/10/31 by Alexander Mednykh, Mednykh, Alexander, I. A. Mednykh +2 · 4 citations
   Mathematics · Physics and Astronomy · #05C30 #39A10 #Advanced Combinatorial Mathematics #Advanced Mathematical Theories and Applications #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #math.CO #msc:05C30 #msc:39A10
2. On rationality of generating function for the number of spanning trees in circulant graphs
   2018/11/09 by A. D. Mednykh, Mednykh, A. D., I. A. Mednykh +1 · 2 citations
   Mathematics · #05C30 #39A10 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05C30 #msc:39A10
3. On Jacobian group and complexity of the generalized Petersen graph GP(n,k) through Chebyshev polynomials
   2016/12/11 by Y. S. Kwon, Kwon, Y. S., A. D. Mednykh +3 · 3 citations
   Mathematics · #05C30 #39A10 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05C30 #msc:39A10
4. The number of rooted forests in circulant graphs
   2019/07/04 by L. A. Grunwald, Grunwald, L. A., I. A. Mednykh +1 · 1 citation
   Mathematics · #05C30 #39A12 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05C30 #msc:39A12