Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Ilya A. Mednykh

> Home > Persons

Person information

affiliation: Sobolev Institute of Mathematics, Novosibirsk, Russia

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

Journal Articles

see FAQ

What is the meaning of the colors in the publication lists?

2022
[j7]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/arsmc/GrunwaldM22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/arsmc/GrunwaldM22
Lilya A. Grunwald, Ilya A. Mednykh:
The number of rooted forests in circulant graphs. Ars Math. Contemp. 22(4): 4 (2022)
[j6]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/arsmc/MednykhM22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/arsmc/MednykhM22
Alexander D. Mednykh, Ilya A. Mednykh:
Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics. Ars Math. Contemp. 23(1) (2022)
2019
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/dm/MednykhM19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/MednykhM19
Alexander D. Mednykh, Ilya A. Mednykh:
The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic. Discret. Math. 342(6): 1772-1781 (2019)
2018
[j4]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/arsmc/Mednykh18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/arsmc/Mednykh18
Ilya A. Mednykh:
On Jacobian group and complexity of I-graph I(n, k, l) through Chebyshev polynomials. Ars Math. Contemp. 15(2): 467-485 (2018)
2016
[j3]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/arsmc/MednykhM16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/arsmc/MednykhM16
Alexander D. Mednykh, Ilya A. Mednykh:
On gamma-hyperellipticity of graphs. Ars Math. Contemp. 10(1): 183-192 (2016)
[j2]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/arsmc/MednykhM16a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/arsmc/MednykhM16a
Alexander D. Mednykh, Ilya A. Mednykh:
Isospectral genus two graphs are isomorphic. Ars Math. Contemp. 10(2): 223-235 (2016)
2015
[j1]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dm/MednykhM15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/MednykhM15
Alexander D. Mednykh, Ilya A. Mednykh:
On Wiman's theorem for graphs. Discret. Math. 338(10): 1793-1800 (2015)

Coauthor Index

see FAQ

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.