Name
Abstract | ||
|---|---|---|
Given a graph G, the modularity of a partition of the vertex set measures the extent to which edge density is higher within parts than between parts; and the modularity of G is the maximum modularity of a partition. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.endm.2013.07.063 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
edge expansion,isoperimetric number,lattices,regular graphs,random regular graphs,random cubic graphs | Discrete mathematics,Random regular graph,Combinatorics,Indifference graph,Random graph,Chordal graph,Pathwidth,1-planar graph,Mathematics,Metric dimension,Maximal independent set | Journal |
Volume | ISSN | Citations |
43 | 1571-0653 | 3 |
PageRank | References | Authors |
0.41 | 4 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Colin McDiarmid | 1 | 1071 | 167.05 |
| Fiona Skerman | 2 | 8 | 4.26 |