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
Facts
3 properties- Subclass of
- bipartite graph[2]
- Named after
- modular lattice[1]
- Studied by
- graph theory[3]
🏷️ Also known as
en modular graph
ar بيان مقاسي
fr graphe modulaire
he גרף מודולארי
he גרף מודולרי
hu moduláris gráf
ru модулярный граф
🔖 Identifiers · 2
- Google Knowledge Graph ID
- /g/11c1tly51x
Press Enter · cited answer in seconds