Mednykh, Alexander

1. The number of spanning trees in circulant graphs, its arithmetic\n properties and asymptotic
   2017/10/31 by Alexander Mednykh, Mednykh, Alexander, I. A. Mednykh +1 · 2 citations
   Mathematics · Physics and Astronomy · #05C30 #39A10 #Advanced Combinatorial Mathematics #Advanced Mathematical Theories and Applications #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications
2. Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics
   2018/12/10 by Mednykh, Alexander, Mednykh, Ilya · 1 citation
   #05C30 #39A10 #Combinatorics (math.CO) #FOS: Mathematics
3. Complexity of the circulant foliation over a graph
   2019/02/15 by Kwon, Young Soo, Mednykh, Alexander, Mednykh, Ilya · 1 citation
   #05C30 #39A10 #Combinatorics (math.CO) #FOS: Mathematics
4. On the complexity of Cayley graphs on a dihedral group
   2023/12/27 by Hua, Bobo, Mednykh, Alexander, Mednykh, Ilya +1 · 1 citation
   #05C30 #39A12 #Combinatorics (math.CO) #FOS: Mathematics