On Wiman's theorem for graphs. - Alexander D. Mednykh; Ilya A. Mednykh (Discret. Math., 2015)

On gamma-hyperellipticity of graphs. - Alexander D. Mednykh; Ilya A. Mednykh (Ars Math. Contemp., 2016)

Isospectral genus two graphs are isomorphic. - Alexander D. Mednykh; Ilya A. Mednykh (Ars Math. Contemp., 2016)

On Jacobian group and complexity of I-graph I(n, k, l) through Chebyshev polynomials. - Ilya A. Mednykh (Ars Math. Contemp., 2018)

The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic. - Alexander D. Mednykh; Ilya A. Mednykh (Discret. Math., 2019)

The number of rooted forests in circulant graphs. - Lilya A. Grunwald; Ilya A. Mednykh (Ars Math. Contemp., 2022)

Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics. - Alexander D. Mednykh; Ilya A. Mednykh (Ars Math. Contemp., 2022)

On the structure of Laplacian characteristic polynomial for circulant foliation. - Y. S. Kwon; Alexander D. Mednykh; Ilya A. Mednykh (Discret. Appl. Math., 2025)

On the complexity of Cayley graphs on a dihedral group. - Bobo Hua; Alexander D. Mednykh; Ilya A. Mednykh; Lili Wang (Discret. Math., 2026)