|
This article is available for purchase or by subscription. See below.
Abstract
|
|
Modularity is designed to measure the strength of a division of a network into clusters. For
, consider
a set
of
elements. Let
be the set of all
subsets of
of
size
. Consider
the graph
with vertices
and edges that connect two vertices if and only if their intersection has size
. In this article, we find
the exact modularity of
for
.
|
PDF Access Denied
We have not been able to recognize your IP address
35.173.48.18
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, line graphs, Johnson graphs
|
Mathematical Subject Classification
Primary: 05C76
|
Milestones
Received: 14 May 2020
Revised: 12 July 2020
Accepted: 27 July 2020
Published: 16 January 2021
|
|
