5 citations · 5 across the 2 of their papers we have counts for
2 papers
math.CO2021
On Jacobian group and complexity of the Y-graph
Y. S. Kwon, A. D. Mednykh, I. A. Mednykh
In the present paper we suggest a simple approach for counting Jacobian group of the -graph In the case the structure of the Jacobian group will…
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 $…