M. M. Ipatov, M. Koshelev, A. M. Raigorodskii, “Modularity of some distance graphs”, Dokl. RAN. Math. Inf. Proc. Upr., 2020, Volume 490,Pages <nobr>71–73</nobr>

RUS ENG

JOURNALS // Doklady Rossijskoj Akademii Nauk. Mathematika, Informatika, Processy Upravlenia // Archive

Dokl. RAN. Math. Inf. Proc. Upr., 2020 Volume 490, Pages 71–73 (Mi danma37)

This article is cited in 9 papers

INFORMATICS

Modularity of some distance graphs

M. M. Ipatov^a, M. Koshelev^a, A. M. Raigorodskii^abcd

^a Lomonosov Moscow State University, Moscow, Russian Federation
^b Caucasus Mathematical Center, Adyghe State University, Maykop, Russian Federation
^c Moscow Institute of Physics and Technology (National Research University), Dolgoprudny, Moscow Region, Russian Federation
^d Buryat State University, Institute for Mathematics and Informatics, Ulan-Ude, Russian Federation

Abstract: New bounds on the modularity of distance graphs were obtained and the exact value of modularity was calculated for $G(n,2,1)$ graphs.

Keywords: distance graphs, Johnson graphs, modularity, clusterization.

UDC: 519

Presented: V. V. Kozlov
Received: 24.07.2019
Revised: 27.07.2019
Accepted: 01.11.2019

DOI: 10.31857/S2686954320010142

English version: Doklady Mathematics, 2020, 101:1, 60–61

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2025