Translator Disclaimer
2021 Exact modularity of line graphs of complete graphs
Mikhail Ipatov
Mosc. J. Comb. Number Theory 10(1): 61-75 (2021). DOI: 10.2140/moscow.2021.10.61

Abstract

Modularity is designed to measure the strength of a division of a network into clusters. For n, consider a set S of n elements. Let V be the set of all subsets of S of size r. Consider the graph G(n,r,s) with vertices V and edges that connect two vertices if and only if their intersection has size s. In this article, we find the exact modularity of G(n,2,1) for n5.

Citation

Download Citation

Mikhail Ipatov. "Exact modularity of line graphs of complete graphs." Mosc. J. Comb. Number Theory 10 (1) 61 - 75, 2021. https://doi.org/10.2140/moscow.2021.10.61

Information

Received: 14 May 2020; Revised: 12 July 2020; Accepted: 27 July 2020; Published: 2021
First available in Project Euclid: 22 January 2021

Digital Object Identifier: 10.2140/moscow.2021.10.61

Subjects:
Primary: 05C76

Keywords: Johnson graphs , line graphs , modularity

Rights: Copyright © 2021 Mathematical Sciences Publishers

JOURNAL ARTICLE
15 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.10 • No. 1 • 2021
MSP
Back to Top