median graph
/M IY1 D IY0 AH0 N G R AE0 F/N
- 1
In graph theory, a division of mathematics, a median graph is an undirected graph in which every three vertices a, b, and c have a unique median: a vertex m(a,b,c) that belongs to shortest paths between each pair of a, b, and c.
Translate “median graph” into another language
Choose a language below to open the translator with English selected as the source language.