Modular graph
Summary
In graph theory, a branch of mathematics, the modular graphs are undirected graphs in which every three vertices , , and have at least one median vertex that belongs to shortest paths between each pair of , , and . Their name comes from the fact that a finite lattice is a modular lattice if and only if its Hasse diagram is a modular graph.
Further reading
- Wikipedia, page 51807881, revision 1167017433, Modular graph. adopted
About this page
| Tag | AVM0703S4K |
|---|---|
| URI | m2://AVM0703S4K |
| Kind | concept |
| Writing | W1 stated |
| Same as | |
| 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.