1 - 20 out of 24Page size: 20
  1. 2026

  2. On the complexity of Cayley graphs on a dihedral group

    Hua, B., Mednykh, A. D., Mednykh, I. A. & Wang, L., 1 Jan 2026, In: Discrete Mathematics. 349, 1, 11 p., 114662.

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

  3. 2025

  4. On the structure of Laplacian characteristic polynomial for circulant foliation

    Kwon, Y. S., Mednykh, A. D. & Mednykh, I. A., 1 Nov 2025, In: Discrete Applied Mathematics. 375, p. 338-349 12 p.

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

  5. 2024

  6. The Kirchhoff Indices for Circulant Graphs

    Mednykh, A. D. & Mednykh, I. A., Nov 2024, In: Siberian Mathematical Journal. 65, 6, p. 1359-1372 14 p.

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

  7. On the Structure of Laplacian Characteristic Polynomial of Circulant Graphs

    Kwon, Y. S., Mednykh, A. D. & Mednykh, I. A., Feb 2024, In: Doklady Mathematics. 109, 1, p. 25-29 5 p.

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

  8. 2023

  9. Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians

    Mednykh, A. D. & Mednykh, IY. A., 2023, In: Russian Mathematical Surveys. 78, 3, p. 501-548 48 p.

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

  10. 2022

  11. Counting rooted spanning forests for circulant foliation over a graph

    Grunwald, L. A., Kwon, Y. S. & Mednykh, I., 15 Dec 2022, In: Tohoku Mathematical Journal. 74, 4, p. 535-548 19 p.

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

  12. Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics

    Mednykh, A. & Mednykh, I., 2022, In: Ars Mathematica Contemporanea. 23, 1, 2530.

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

  13. On Jacobian group and complexity of the Y-graph

    Kwon, Y. S., Mednykh, A. D. & Mednykh, I. A., 2022, In: Siberian Electronic Mathematical Reports. 19, 2, p. 662-673 12 p.

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

  14. The number of rooted forests in circulant graphs

    Grunwald, L. A. & Mednykh, I., 2022, In: Ars Mathematica Contemporanea. 22, 4, #P4.10.

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

  15. 2021

  16. Plans’ Periodicity Theorem for Jacobian of Circulant Graphs

    Mednykh, A. D. & Mednykh, I. A., May 2021, In: Doklady Mathematics. 103, 3, p. 139-142 4 p.

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

  17. On the jacobian group of a cone over a circulant graph

    Grunwald, L. A. & Mednykh, I. A., Mar 2021, In: Mathematical Notes of NEFU. 28, 2, p. 88-101 14 p., 6.

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

  18. Complexity of the circulant foliation over a graph

    Kwon, Y. S., Mednykh, A. D. & Mednykh, I. A., Feb 2021, In: Journal of Algebraic Combinatorics. 53, 1, p. 115-129 15 p.

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

  19. 2020

  20. Kirchhoff Index for Circulant Graphs and Its Asymptotics

    Mednykh, A. D. & Mednykh, I. A., Sept 2020, In: Doklady Mathematics. 102, 2, p. 392-395 4 p.

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

  21. On Rationality of Generating Function for the Number of Spanning Trees in Circulant Graphs

    Mednykh, A. D. & Mednykh, I. A., 1 Mar 2020, In: Algebra Colloquium. 27, 1, p. 87-94 8 p.

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

  22. 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

  23. 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

  24. 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

  25. 2019

  26. 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

  27. 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

  28. 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

Previous 1 2 Next

ID: 3433335