Geodesic
Modularity of some distance graphs
Doklady Rossijskoj akademii nauk. Matematika, informatika, processy upravleniâ, Tome 490 (2020), pp. 71-73.

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{DANMA_2020_490_a15,
     author = {M. M. Ipatov and M. Koshelev and A. M. Raigorodskii},
     title = {Modularity of some distance graphs},
     journal = {Doklady Rossijskoj akademii nauk. Matematika, informatika, processy upravleni\^a},
     pages = {71--73},
     publisher = {mathdoc},
     volume = {490},
     year = {2020},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DANMA_2020_490_a15/}
}
TY  - JOUR
AU  - M. M. Ipatov
AU  - M. Koshelev
AU  - A. M. Raigorodskii
TI  - Modularity of some distance graphs
JO  - Doklady Rossijskoj akademii nauk. Matematika, informatika, processy upravleniâ
PY  - 2020
SP  - 71
EP  - 73
VL  - 490
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DANMA_2020_490_a15/
LA  - ru
ID  - DANMA_2020_490_a15
ER  - 
%0 Journal Article
%A M. M. Ipatov
%A M. Koshelev
%A A. M. Raigorodskii
%T Modularity of some distance graphs
%J Doklady Rossijskoj akademii nauk. Matematika, informatika, processy upravleniâ
%D 2020
%P 71-73
%V 490
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DANMA_2020_490_a15/
%G ru
%F DANMA_2020_490_a15
M. M. Ipatov; M. Koshelev; A. M. Raigorodskii. Modularity of some distance graphs. Doklady Rossijskoj akademii nauk. Matematika, informatika, processy upravleniâ, Tome 490 (2020), pp. 71-73. http://geodesic.mathdoc.fr/item/DANMA_2020_490_a15/

[1] Ostroumova-Prokhorenkova L., Pralat P., Raigorodskii A., “Modularity in Several Random Graph Models”, Electronic Notes in Discrete Mathematics, 61 (2017), 947–953 | DOI | Zbl

[2] Ostroumova-Prokhorenkova L., Pralat P., Raigorodskii A., “Modularity of Complex Networks Models”, Internet Mathematics http://www.internetmathematicsjournal.com/article/1916-modularity-of-complex-networks-models | DOI | MR

[3] Iskhakov L., Mironov M., Prokhorenkova L., Kaminski B., Pralat P., “Klasternyi koeffitsient v modeli prostranstvennogo predpochtitelnogo prisoedineniya”, DAN, 481:1 (2018), 10–14 | MR

[4] Iskhakov L., Kaminski B., Mironov M., Ostroumova-Prokhorenkova L., Pralat P., “Clustering Properties of Spatial Preferential Attachment Model”, Proceedings of the 15th Workshop on Algorithms and Models for the Web Graph, WAW 2018, Lecture Notes in Computer Science, 10836, Springer, 2018, 30–43 | DOI | MR

[5] Iskhakov L., Kaminski B., Mironov M., Ostroumova-Prokhorenkova L., Pralat P., “Local Clustering Coefficient of Spatial Preferential Attachment Model”, J. Complex Networks | MR

[6] Sagdeev A.A., Raigorodskii A.M., “On a Frankl-Wilson theorem and its geometric corollaries”, Acta Math. Univ. Comenianae, 2019 | MR

[7] Bogolyubskii L.I., Raigorodskii A.M., “Zamechanie o nizhnikh otsenkakh khromaticheskikh chisel prostranstv maloi razmernosti s metrikami $l_1$ i $l_2$”, Matem. zametki, 105:2 (2019), 187–213 | DOI | MR | Zbl

[8] Pushnyakov F.A., “O kolichestvakh reber v porozhdennykh podgrafakh nekotorykh distantsionnykh grafov”, Matem. zametki, 105:4 (2019), 592–602 | DOI | MR | Zbl

[9] Shishunov E.D., Raigorodskii A.M., “O chislakh nezavisimosti nekotorykh distantsionnykh grafov s vershinami v ${{\{ - 1,0,1\} }^{n}}$”, DAN, 485:3 (2019), 269–271 | MR | Zbl

[10] Prosanov R.I., “Kontrprimery k gipoteze Borsuka, imeyuschie bolshoi obkhvat”, Matem. zametki, 105:6 (2019), 890–898 | DOI | MR | Zbl

[11] Kostina O.A., “On Lower Bounds for the Chromatic Number of Spheres”, Math. Notes, 105:1 (2010), 16–27 | MR

[12] Frankl P., Kupavskii A., “Partition-free families of sets”, Proceedings of the London Math. Society, 2019 | DOI | MR

[13] Frankl P., Kupavskii A., “Families of Sets with No Matching of Sizes 3 and 4”, Europ. J. Combinatorics, 75 (2019), 123–135 | DOI | MR | Zbl

[14] Shabanov D.A., Krokhmal N.E., Kravtsov D.A., “Panchromatic 3-colorings of random hypergraphs”, Europ. J. Combinatorics, 78 (2019), 28–43 | DOI | MR | Zbl

[15] Balogh J., Cherkashin D., Kiselev S., “Coloring General Kneser Graphs and Hypergraphs via High-Discrepancy Hypergraphs”, Europ. J. Combinatorics, 79C (2019), 228–236 | DOI | MR | Zbl