Vol. 10, No. 1, 2021

Download this article
Download this article For screen
For printing
Recent Issues
Volume 13, Issue 4
Volume 13, Issue 3
Volume 13, Issue 2
Volume 13, Issue 1
Volume 12, Issue 4
Volume 12, Issue 3
Volume 12, Issue 2
Volume 12, Issue 1
Volume 11, Issue 4
Volume 11, Issue 3
Volume 11, Issue 2
Volume 11, Issue 1
Volume 10, Issue 4
Volume 10, Issue 3
Volume 10, Issue 2
Volume 10, Issue 1
Volume 9, Issue 4
Volume 9, Issue 3
Volume 9, Issue 2
Volume 9, Issue 1
Volume 8, Issue 4
Volume 8, Issue 3
Volume 8, Issue 2
Volume 8, Issue 1
Older Issues
Volume 7, Issue 4
Volume 7, Issue 3
Volume 7, Issue 2
Volume 7, Issue 1
Volume 6, Issue 4
Volume 6, Issue 2-3
Volume 6, Issue 1
Volume 5, Issue 4
Volume 5, Issue 3
Volume 5, Issue 1-2
Volume 4, Issue 4
Volume 4, Issue 3
Volume 4, Issue 2
Volume 4, Issue 1
Volume 3, Issue 3-4
Volume 3, Issue 2
Volume 3, Issue 1
Volume 2, Issue 4
Volume 2, Issue 3
Volume 2, Issue 2
Volume 2, Issue 1
Volume 1, Issue 4
Volume 1, Issue 3
Volume 1, Issue 2
Volume 1, Issue 1
The Journal
About the journal
Ethics and policies
Peer-review process
 
Submission guidelines
Submission form
Editorial board
founded and published with the
scientific support and advice of
mathematicians from the
Moscow Institute of
Physics and Technology
Subscriptions
 
ISSN 2996-220X (online)
ISSN 2996-2196 (print)
Author Index
To Appear
 
Other MSP Journals
New lower bound on the modularity of Johnson graphs

Mikhail Koshelev

Vol. 10 (2021), No. 1, 77–82
Abstract

The modularity of a graph is a value that shows how well the graph can be split into clusters. It is a key part in many clustering algorithms. In this paper, we improve the lower bound on the modularity of Johnson graphs significantly.

Keywords
modularity, Johnson graphs, clusterization
Mathematical Subject Classification
Primary: 05C99
Milestones
Received: 14 June 2020
Revised: 10 July 2020
Accepted: 27 July 2020
Published: 16 January 2021
Authors
Mikhail Koshelev
Mechanics and Mathematics Faculty
Moscow State University
Moscow
Russia