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.
| Origin | Files produced by the author(s) |
|---|