Modularity of regular and treelike graphs
From MaRDI portal
Publication:3388894
DOI10.1093/comnet/cnx046zbMath1462.05331arXiv1606.09101OpenAlexW2964214348MaRDI QIDQ3388894
Fiona Skerman, Colin J. H. McDiarmid
Publication date: 7 May 2021
Published in: Journal of Complex Networks (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.09101
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (9)
On the modularity of 3‐regular random graphs and random graphs with given degree sequences ⋮ Modularity of minor‐free graphs ⋮ Modularity in planted partition model ⋮ Unnamed Item ⋮ Modularity of Erdős‐Rényi random graphs ⋮ Modularity of some distance graphs ⋮ New modularity bounds for graphs \(G(n,r,s)\) and \(G_p(n,r,s)\) ⋮ The parameterised complexity of computing the maximum modularity of a graph ⋮ Spectrum of Johnson graphs
This page was built for publication: Modularity of regular and treelike graphs
