Elsevier

Discrete Mathematics

Volume 111, Issues 1–3, 22 February 1993, Pages 49-63
Discrete Mathematics

Median graphs, parallelism and posets

https://doi.org/10.1016/0012-365X(93)90140-OGet rights and content
Under an Elsevier user license
open archive

Abstract

A notion of parallelism is defined in finite median graphs and a number of properties about geodesics and the existence of cubes are obtained. Introducing sites as a double structure of partial order and graph on a set, it is shown that all median graphs can be constructed from sites and, in fact, that the categories of sites and pointed median graphs are equivalent, generalizing Birkhoff's duality.

Cited by (0)