Modularity of minor-free graphs

Abstract

We prove that a class of graphs with an excluded minor and with the maximum degree sublinear in the number of edges is maximally modular, that is, modularity tends to 1 as the number of edges tends to infinity.

7 pages, 1 figure

References in corpus (2)

• Fast unfolding of communities in large networks
• On the modularity of 3-regular random graphs and random graphs with given degree sequences

Cited by in corpus (1)

• Edge separators for graphs excluding a minor