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.
Citation
Mikhail Koshelev. "New lower bound on the modularity of Johnson graphs." Mosc. J. Comb. Number Theory 10 (1) 77 - 82, 2021. https://doi.org/10.2140/moscow.2021.10.77
Information
