A metric \(d\) on a finite set \(X\) is called antipodal if there exists a map \(\sigma: X \rightarrow X\) so that \(d(x,\sigma(x))= d(x,y) + d(y,\sigma (x))\) holds for all \(x,y \in X.\) In this paper the authors examine antipodal metrics that are in addition totally split decomposable and give explicit characterization of such metrics.
Recommendations
Cites work
- A canonical decomposition theory for metrics on a finite set
- An exceptional split geometry
- Analyzing and visualizing sequence and distance data using SPLITSTREE
- Antipodal graphs and oriented matroids
- Cross-cloning and antipodal graphs
- Even graphs
- Extension operations for cuts
- Geometry of cuts and metrics
- scientific article; zbMATH DE number 1618179 (Why is no real title available?)
- scientific article; zbMATH DE number 863510 (Why is no real title available?)
- On the tight span of an antipodal graph
- Six points suffice: How to check for metric consistency
- Totally split-decomposable metrics of combinatorial dimension two
Cited in
(3)
This page was built for publication: Antipodal metrics and split systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1348745)
