Alexander D. Mednykh

Orcid: 0000-0003-3084-1225

Affiliations:
  • Novosibirsk State University, Sobolev Institute of Mathematics, Russia


According to our database1, Alexander D. Mednykh authored at least 18 papers between 2003 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
The Jacobian of a graph and graph automorphisms.
Discret. Math., 2025

2023
A general construction of strictly Neumaier graphs and a related switching.
Discret. Math., July, 2023

2022
Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics.
Ars Math. Contemp., October, 2022

2021
On a representation of the automorphism group of a graph in a unimodular group.
Discret. Math., 2021

2019
The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic.
Discret. Math., 2019

2016
Isospectral genus two graphs are isomorphic.
Ars Math. Contemp., 2016

On gamma-hyperellipticity of graphs.
Ars Math. Contemp., 2016

2015
On Wiman's theorem for graphs.
Discret. Math., 2015

2012
Enumeration of unrooted orientable maps of arbitrary genus by number of edges and vertices.
Discret. Math., 2012

2011
Enumeration of genus-four maps by number of edges.
Ars Math. Contemp., 2011

2010
Enumeration of maps regardless of genus: Geometric approach.
Discret. Math., 2010

Enumeration of unrooted hypermaps of a given genus.
Discret. Math., 2010

2009
On the number of connected and disconnected coverings over a manifold.
Ars Math. Contemp., 2009

2007
Enumeration of unrooted hypermaps.
Electron. Notes Discret. Math., 2007

2006
Enumeration of unrooted maps of a given genus.
J. Comb. Theory B, 2006

2005
Enumeration of Branched Coverings of Nonorientable Surfaces With Cyclic Branch Points.
SIAM J. Discret. Math., 2005

2004
Enumerating branched coverings over surfaces with boundaries.
Eur. J. Comb., 2004

2003
Enumerating Branched Surface Coverings from Unbranched Ones.
LMS J. Comput. Math., 2003


  Loading...