Asymptotic modularity of some graph classes
From MaRDI portal
Recommendations
Cited in
(22)- Post-processing partitions to identify domains of modularity optimization
- Modularity in several random graph models
- New modularity bounds for graphs \(G(n,r,s)\) and \(G_p(n,r,s)\)
- Spectrum of Johnson graphs
- Modular graph functions and asymptotic expansions of Poincaré series
- The hyperbolicity constant of infinite circulant graphs
- Graph schemes, graph series, and modularity
- On computing the Gromov hyperbolicity
- Differential geometric treewidth estimation in adiabatic quantum computation
- Modularity of regular and treelike graphs
- Modularity of Erdős-Rényi random graphs
- scientific article; zbMATH DE number 7378595 (Why is no real title available?)
- Multilayer modularity belief propagation to assess detectability of community structure
- Some Vertex-Graph Parameters on Modular Product of Graphs
- Modularity of Erdős-Rényi random graphs
- On the modularity of 3‐regular random graphs and random graphs with given degree sequences
- Modularity of minor‐free graphs
- Characterization of expansion-related properties of modular graphs
- Bad communities with high modularity
- Modularity of some distance graphs
- Modularity and graph expansion
- Modularity clustering parameterized by max leaf number
This page was built for publication: Asymptotic modularity of some graph classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3104638)