We stand with Ukraine  

Ilya A. Mednykh

Orcid: 0000-0001-7682-3917

Affiliations:
  • Sobolev Institute of Mathematics, Novosibirsk, Russia


According to our database1, Ilya A. Mednykh authored at least 7 papers between 2015 and 2022.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics.
[BibTeX]
[DOI]
Alexander D. Mednykh
,
Ilya A. Mednykh
Ars Math. Contemp., October, 2022

The number of rooted forests in circulant graphs.
[BibTeX]
[DOI]
Lilya A. Grunwald
,
Ilya A. Mednykh
Ars Math. Contemp., 2022

2019
The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic.
[BibTeX]
[DOI]
Alexander D. Mednykh
,
Ilya A. Mednykh
Discret. Math., 2019

2018
On Jacobian group and complexity of <i>I</i>-graph <i>I</i>(<i>n</i>, <i>k</i>, <i>l</i>) through Chebyshev polynomials.
[BibTeX]
[DOI]
Ilya A. Mednykh
Ars Math. Contemp., 2018

2016
Isospectral genus two graphs are isomorphic.
[BibTeX]
[DOI]
Alexander D. Mednykh
,
Ilya A. Mednykh
Ars Math. Contemp., 2016

On gamma-hyperellipticity of graphs.
[BibTeX]
[DOI]
Alexander D. Mednykh
,
Ilya A. Mednykh
Ars Math. Contemp., 2016

2015
On Wiman's theorem for graphs.
[BibTeX]
[DOI]
Alexander D. Mednykh
,
Ilya A. Mednykh
Discret. Math., 2015


  Loading...