21 - 24 out of 24Page size: 10
Sort by: Title

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

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

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

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

Previous 1 2 3 Next

ID: 3433335