Alexander D. Mednykh

20 papers Journal 20
YearRankTypeTitle / Venue / Authors
2026 J jnl
On the complexity of Cayley graphs on a dihedral group.
Discret. Math.
Bobo Hua, Alexander D. Mednykh, Ilya A. Mednykh, Lili Wang
2025 J jnl
On the structure of Laplacian characteristic polynomial for circulant foliation.
Discret. Appl. Math.
Y. S. Kwon, Alexander D. Mednykh, Ilya A. Mednykh
2025 J jnl
The Jacobian of a graph and graph automorphisms.
Discret. Math.
István Estélyi, Ján Karabás, Alexander D. Mednykh, Roman Nedela
2023 J jnl
A general construction of strictly Neumaier graphs and a related switching.
Discret. Math.
Rhys J. Evans, Sergey Goryainov, Elena V. Konstantinova, Alexander D. Mednykh
2022 J jnl
Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics.
Ars Math. Contemp.
Alexander D. Mednykh, Ilya A. Mednykh
2021 J jnl
On a representation of the automorphism group of a graph in a unimodular group.
Discret. Math.
István Estélyi, Ján Karabás, Roman Nedela, Alexander D. Mednykh
2019 J jnl
The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic.
Discret. Math.
Alexander D. Mednykh, Ilya A. Mednykh
2016 J jnl
Isospectral genus two graphs are isomorphic.
Ars Math. Contemp.
Alexander D. Mednykh, Ilya A. Mednykh
2016 J jnl
On gamma-hyperellipticity of graphs.
Ars Math. Contemp.
Alexander D. Mednykh, Ilya A. Mednykh
2015 J jnl
On Wiman's theorem for graphs.
Discret. Math.
Alexander D. Mednykh, Ilya A. Mednykh
2012 J jnl
Enumeration of unrooted orientable maps of arbitrary genus by number of edges and vertices.
Discret. Math.
Timothy R. S. Walsh, Alain Giorgetti, Alexander D. Mednykh
2011 J jnl
Enumeration of genus-four maps by number of edges.
Ars Math. Contemp.
Alexander D. Mednykh, Alain Giorgetti
2010 J jnl
Enumeration of maps regardless of genus: Geometric approach.
Discret. Math.
Antonio Breda d'Azevedo, Alexander D. Mednykh, Roman Nedela
2010 J jnl
Enumeration of unrooted hypermaps of a given genus.
Discret. Math.
Alexander D. Mednykh, Roman Nedela
2009 J jnl
On the number of connected and disconnected coverings over a manifold.
Ars Math. Contemp.
Valery A. Liskovets, Alexander D. Mednykh
2007 J jnl
Enumeration of unrooted hypermaps.
Electron. Notes Discret. Math.
Alexander D. Mednykh, Roman Nedela
2006 J jnl
Enumeration of unrooted maps of a given genus.
J. Comb. Theory B
Alexander D. Mednykh, Roman Nedela
2005 J jnl
Enumeration of Branched Coverings of Nonorientable Surfaces With Cyclic Branch Points.
SIAM J. Discret. Math.
Jin Ho Kwak, Alexander D. Mednykh, Valery A. Liskovets
2004 J jnl
Enumerating branched coverings over surfaces with boundaries.
Eur. J. Comb.
Jin Ho Kwak, Alexander D. Mednykh
2003 J jnl
Enumerating Branched Surface Coverings from Unbranched Ones.
LMS J. Comput. Math.
Jin Ho Kwak, Jaeun Lee, Alexander D. Mednykh