5 citations · 8 across the 9 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
math.CO2018
Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics
Alexander Mednykh, Ilya Mednykh
In the present paper, we investigate a family of circulant graphs with non-fixed jumps $$G_n=C_{βn}(s_1, \ldots,s_k,α_1n,\ldots,α_\ell n),\, 1\le s_1<\ldots<s_k\le[\frac{βn}{2}],\,…
math.CO2018
On rationality of generating function for the number of spanning trees in circulant graphs
A. D. Mednykh, I. A. Mednykh
Let be the generating function for the number of spanning trees in the circulant graphs We show that $F(x…
math.CO2018★ 5 cited
On complexity of cyclic coverings of graphs
Y. S. Kwon, A. D. Mednykh, I. A. Mednykh
By complexity of a finite graph we mean the number of spanning trees in the graph. The aim of the present paper is to give a new approach for counting complexity of cyclic $…