Modularity of minor-free graphs
arXiv:2102.07253 · doi:10.1002/jgt.22896
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.
arXiv comment7 pages, 1 figure
References in corpus (5)
- Fast unfolding of communities in large networks
- Finding and evaluating community structure in networks
- From Louvain to Leiden: guaranteeing well-connected communities
- Communities and bottlenecks: Trees and treelike networks have high modularity
- On the modularity of 3-regular random graphs and random graphs with given degree sequences