1 citations · 1 across the 2 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2016★ 1 cited
On Jacobian group and complexity of the generalized Petersen graph GP(n,k) through Chebyshev polynomials
Y. S. Kwon, A. D. Mednykh, I. A. Mednykh
In the present paper we find a simple algorithm for counting Jacobian group of the generalized Petersen graph GP(n,k). Also, we obtain a closed formula for the number of spanning t…
math.CO2004
Counting conjugacy classes of subgroups in a finitely generated group
A. D. Mednykh
A new general formula for the number of conjugacy classes of subgroups of given index in a finitely generated group is obtained.