modular graph
in graph theory, an undirected graph in which every three vertices x, y, and z have at least one median vertex m(x, y, z) that belongs to shortest paths between each pair of x, y, and z
Press Enter · cited answer in seconds
0 sources
modular graph
Summary
Key Facts
- modular graph's image is recorded as 2d modular lattice.svg[1].
- modular lattice is named after modular graph[2].
- modular graph's subclass of is recorded as bipartite graph[3].
- modular graph's studied by is recorded as graph theory[4].
- modular graph's Google Knowledge Graph ID is recorded as /g/11c1tly51x[5].
- modular graph's graphclasses.org ID is recorded as gc_50[6].
- modular graph's graphclasses.org ID is recorded as gc_584[7].