11 - 20 out of 22Page size: 10
Sort by: Title

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

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

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

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

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

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

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

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

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

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

ID: 3433335