Mikhail M. Koshelev

According to our database, Mikhail M. Koshelev authored at least 5 papers between 2020 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

Modularity of some distance graphs.

Mikhail M. Ipatov, Mikhail M. Koshelev, Andrei M. Raigorodskii

Eur. J. Comb., March, 2024

2023

Modularity in planted partition model.

Mikhail M. Koshelev

Comput. Manag. Sci., December, 2023

Spectrum of Johnson graphs.

Mikhail M. Koshelev

Discret. Math., 2023

2021

New Modularity Bounds for Graphs G(n, r, s) and G_{p(n, r, s)}.

Nikita Mikhailovich Derevyanko, Mikhail M. Koshelev

Probl. Inf. Transm., 2021

2020

New bounds on clique-chromatic numbers of Johnson graphs.

Andrei M. Raigorodskii, Mikhail M. Koshelev

Discret. Appl. Math., 2020