31 - 37 out of 37Page size: 10
Sort by: Title

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

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

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

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

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

  6. Area and volume in non-Euclidean geometry

    Abrosimov, N. & Mednykh, A., 2019, EIGHTEEN ESSAYS IN NON-EUCLIDEAN GEOMETRY. Alberge & Papadopoulos, A. (eds.). European Mathematical society, p. 151-189 39 p. (IRMA Lectures in Mathematics and Theoretical Physics; vol. 29).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › Research › peer-review

  7. A general construction of strictly Neumaier graphs and a related switching

    Evans, R. J., Goryainov, S., Konstantinova, E. V. & Mednykh, A. D., Jul 2023, In: Discrete Mathematics. 346, 7, 113384.

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

Previous 1 2 3 4 Next

ID: 3450861