Partial cubes and their \(\tau\)-graphs (Q875040)
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: Partial cubes and their -graphs |
scientific article; zbMATH DE number 5141655
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partial cubes and their \(\tau\)-graphs |
scientific article; zbMATH DE number 5141655 |
Statements
Partial cubes and their \(\tau\)-graphs (English)
0 references
10 April 2007
0 references
A partial cube graph is an isometric subgraph of a hypercube. On such graphs the Djoković-Winkler relation is an equivalence. The equivalence classes form the \(\tau\)-graph with edges corresponding to convex 3-node paths. It is shown that any graph is the \(\tau\)-graph of some median graph. The \(\tau\)-graph is connected only for Cartesian prime graphs. For a median graph it is \(K_n\)-free if and only if the original contains no convex star.
0 references
partial cube
0 references
convex path
0 references
Djoković-Winkler relation
0 references
median graph
0 references
0.841006338596344
0 references
0.8338978886604309
0 references
0.8279525637626648
0 references
0.798225462436676
0 references
