Median graph
Summary
In graph theory, a division of mathematics, a median graph is an undirected graph in which every three vertices , , and have a unique median: a vertex that belongs to shortest paths between each pair of , , and .
Further reading
- Wikipedia, page 16970848, revision 1343824067, Median graph. adopted
About this page
| Tag | 5HA8JR4020 |
|---|---|
| URI | m2://5HA8JR4020 |
| Aliases | median-network |
| 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.