# 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

**Wikidata**: [Q28455823](https://www.wikidata.org/wiki/Q28455823)  
**Wikipedia**: [English](https://en.wikipedia.org/wiki/Modular_graph)  
**Source**: https://4ort.xyz/entity/modular-graph