1. 2020
  2. 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 journalArticlepeer-review

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

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

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

  6. Two Moore’s Theorems for Graphs

    Mednykh, A. & Mednykh, I., 2020, In: Rendiconti dell'Istituto di Matematica dell'Universita di Trieste. 52, p. 469-476 8 p.

    Research output: Contribution to journalArticlepeer-review

  7. 2019
  8. 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 journalArticlepeer-review

  9. The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic

    Mednykh, A. D. & Mednykh, I. A., 1 Jun 2019, In: Discrete Mathematics. 342, 6, p. 1772-1781 10 p.

    Research output: Contribution to journalArticlepeer-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 journalArticlepeer-review

  11. 2018
  12. 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 journalArticlepeer-review

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

ID: 3433335