Modular
Summary
Modular graph, a graph in which each triple of vertices has at least one median vertex that belongs to shortest paths between all pairs of the triple.
Modular decomposition, a decomposition of a graph into subgraphs within which all vertices connect to the rest of the graph in the same way.
Modularity of a graph clustering, the difference of the number of cross-cluster edges from its expected value.
Further reading
- Wikipedia, page 325802, revision 1373839425, Glossary of graph theory, section M. adopted
About this page
| Tag | PB8A4764ZG |
|---|---|
| URI | m2://PB8A4764ZG |
| Kind | concept |
| Writing | W1 stated |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.