11 - 20 out of 20Page size: 10
  1. 2020

  2. On the structure of the critical group of a circulant graph with non-constant jumps

    Mednykh, A. D. & Mednykh, I. A., 1 Feb 2020, In: Russian Mathematical Surveys. 75, 1, p. 190-192 3 p., 5.

    Research output: Contribution to journal › Article › peer-review

  3. Counting rooted spanning foresrs in cobordism of two circulant graphs

    Abrosimov, N. V., Baigonakova, G. A., Grunwald, L. A. & Mednykh, I. A., 2020, In: Siberian Electronic Mathematical Reports. 17, p. 814-823 10 p.

    Research output: Contribution to journal › Article › peer-review

  4. Two Moore’s Theorems for Graphs

    Mednykh, A. & Mednykh, I., 2020, In: Rendiconti dell'Istituto di Matematica dell'Universita di Trieste. 52, p. 469-476 8 p.

    Research output: Contribution to journal › Article › peer-review

  5. 2019

  6. On automorphisms of graphs and Riemann surfaces acting with fixed points

    Gromadzki, G., Mednykh, A. D. & Mednykh, I. A., 1 Dec 2019, In: Analysis and Mathematical Physics. 9, 4, p. 2021-2031 11 p.

    Research output: Contribution to journal › Article › peer-review

  7. The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic

    Mednykh, A. D. & Mednykh, I. A., 1 Jun 2019, In: Discrete Mathematics. 342, 6, p. 1772-1781 10 p.

    Research output: Contribution to journal › Article › peer-review

  8. Complexity of Discrete Seifert Foliations over a Graph

    Kwon, Y. S., Mednykh, A. D. & Mednykh, I. A., 1 May 2019, In: Doklady Mathematics. 99, 3, p. 286-289 4 p.

    Research output: Contribution to journal › Article › peer-review

  9. 2018

  10. Asymptotics and Arithmetical Properties of Complexity for Circulant Graphs

    Mednykh, A. D. & Mednykh, I. A., 1 Mar 2018, In: Doklady Mathematics. 97, 2, p. 147-151 5 p.

    Research output: Contribution to journal › Article › peer-review

  11. Counting spanning trees in cobordism of two circulant graphs

    Baigonakova, G. A. & Mednykh, I. A., 1 Jan 2018, In: Сибирские электронные математические известия. 15, p. 1145-1157 13 p.

    Research output: Contribution to journal › Article › peer-review

  12. On Jacobian group and complexity of the I-graph I(n, k, l) through Chebyshev polynomials

    Mednykh, I. A., 2018, In: Ars Mathematica Contemporanea. 15, 2, p. 467-485 19 p.

    Research output: Contribution to journal › Article › peer-review

  13. 2017

  14. On Jacobian group and complexity of the generalized Petersen graph GP(n,k) through Chebyshev polynomials

    Kwon, Y. S., Mednykh, A. D. & Mednykh, I. A., 15 Sept 2017, In: Linear Algebra and Its Applications. 529, p. 355-373 19 p.

    Research output: Contribution to journal › Article › peer-review

Previous 1 2 Next

ID: 3433335