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
en-US/ˈmɑd͡ʒəlɚ ˈɡɹæf/
en-GB/ˈmɒdjʊlə ɡɹɑːf/
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