21 - 24 out of 24Page size: 10
  1. 2018

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

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

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

  5. 2017

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

ID: 3433335