Doklady Rossijskoj Akademii Nauk. Mathematika, Informatika, Processy Upravlenia
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Dokl. RAN. Math. Inf. Proc. Upr.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Doklady Rossijskoj Akademii Nauk. Mathematika, Informatika, Processy Upravlenia, 2020, Volume 490, Pages 71–73
DOI: https://doi.org/10.31857/S2686954320010142
(Mi danma37)
 

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
Full-text PDF (103 kB) Citations (9)
References:
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.
Funding agency Grant number
Russian Foundation for Basic Research 18–01–00355
Ministry of Education and Science of the Russian Federation НШ-6760.2018.1
This work was supported by the Russian Foundation for Basic Research (project no. 18-01-00355) and by the Russian Federation President Grant (project no. NSh-6760.2018.1).
Presented: V. V. Kozlov
Received: 24.07.2019
Revised: 27.07.2019
Accepted: 01.11.2019
English version:
Doklady Mathematics, 2020, Volume 101, Issue 1, Pages 60–61
DOI: https://doi.org/10.1134/S1064562420010147
Bibliographic databases:
Document Type: Article
UDC: 519
Language: Russian
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
Citation in format AMSBIB
\Bibitem{IpaKosRai20}
\by M.~M.~Ipatov, M.~Koshelev, A.~M.~Raigorodskii
\paper Modularity of some distance graphs
\jour Dokl. RAN. Math. Inf. Proc. Upr.
\yr 2020
\vol 490
\pages 71--73
\mathnet{http://mi.mathnet.ru/danma37}
\crossref{https://doi.org/10.31857/S2686954320010142}
\zmath{https://zbmath.org/?q=an:1477.05060}
\elib{https://elibrary.ru/item.asp?id=42579065}
\transl
\jour Dokl. Math.
\yr 2020
\vol 101
\issue 1
\pages 60--61
\crossref{https://doi.org/10.1134/S1064562420010147}
Linking options:
  • https://www.mathnet.ru/eng/danma37
  • https://www.mathnet.ru/eng/danma/v490/p71
  • This publication is cited in the following 9 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Doklady Rossijskoj Akademii Nauk. Mathematika, Informatika, Processy Upravlenia Doklady Rossijskoj Akademii Nauk. Mathematika, Informatika, Processy Upravlenia
    Statistics & downloads:
    Abstract page:123
    Full-text PDF :43
    References:17
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024