About: 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
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
| Property | Value |
|---|---|
| dbo:description |
|
| dbo:thumbnail | |
| dbo:wikiPageWikiLink |
|
| dbp:wikiPageUsesTemplate | |
| dct:subject | |
| rdfs:label |
|
| owl:differentFrom | |
| owl:sameAs | |
| prov:wasDerivedFrom | |
| foaf:depiction | |
| foaf:isPrimaryTopicOf | |
| is dbo:wikiPageWikiLink of | |
| is foaf:primaryTopic of |
