A characterization of median graphs (Q762504)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A characterization of median graphs |
scientific article; zbMATH DE number 3889580
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A characterization of median graphs |
scientific article; zbMATH DE number 3889580 |
Statements
A characterization of median graphs (English)
0 references
1984
0 references
A connected graph G is median graph if for any three points a, b, c there is a unique point t satisfying the equations \(d(a,b)=d(a,t)+d(t,b)\), \(d(a,c)=d(a,t)+d(t,c)\) and \(d(b,c)=d(b,t)+d(t,c)\). A pointset B is a convex if B contains all points of any shortest a-b path for every pair a,b\(\in B\). The paper gives a characterization of median graphs by means of convex sets in graphs.
0 references
convexies of graphs
0 references
median graph
0 references
