|
This article is cited in 9 scientific papers (total in 9 papers)
INFORMATICS
Modularity of some distance graphs
M. M. Ipatova, M. Kosheleva, A. M. Raigorodskiiabcd 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.
Citation:
M. M. Ipatov, M. Koshelev, A. M. Raigorodskii, “Modularity of some distance graphs”, Dokl. RAN. Math. Inf. Proc. Upr., 490 (2020), 71–73; Dokl. Math., 101:1 (2020), 60–61
Linking options:
https://www.mathnet.ru/eng/danma37 https://www.mathnet.ru/eng/danma/v490/p71
|
Statistics & downloads: |
Abstract page: | 123 | Full-text PDF : | 43 | References: | 17 |
|