I. Mednykh

activity

20172024

most citedOn complexity of cyclic coverings of graphs

5 citations · 8 across the 9 of their papers we have counts for

collaborators

Showing 2019Show all

2 papers · 1 filter

math.CO2019★ 3 cited

The number of rooted forests in circulant graphs

L. A. Grunwald, I. A. Mednykh

In this paper, we develop a new method to produce explicit formulas for the number $f_{G} (n)$ of rooted spanning forests in the circulant graphs $G = C_{n} (s_{1}, s_{2}, \dots, s_{k})$ and…

math.CO2019

Complexity of the circulant foliation over a graph

Young Soo Kwon, Alexander Mednykh, Ilya Mednykh

In the present paper, we investigate the complexity of infinite family of graphs $H_{n} = H_{n} (G_{1}, G_{2}, \dots, G_{m})$ obtained as a circulant foliation over a graph $H$ on $m$ vertices…