11 - 20 out of 28Page size: 10
  1. 2022

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

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

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

  5. 2021

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

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

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

  9. 2020

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

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

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

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

Previous 1 2 3 Next

ID: 3433335