|
This article is available for purchase or by subscription. See below.
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.
|
PDF Access Denied
We have not been able to recognize your IP address
3.133.147.87
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.
You may also contact us at
contact@msp.org
or by using our
contact form.
Or, you may purchase this single article for
USD 40.00:
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
|
|
