McDiarmid, C., & Skerman, F. (2026). On Graphs with Modularity Zero or Near-Zero. The Electronic Journal of Combinatorics, 33(3), #P3.51. https://doi.org/10.37236/12644