On the tight span of an antipodal graph

Goodmann, Oliver and Moulton, V. ORCID: https://orcid.org/0000-0001-9371-6435 (2000) On the tight span of an antipodal graph. Discrete Mathematics, 218 (1-3). pp. 73-96. ISSN 0012-365X

Full text not available from this repository. (Request a copy)

Abstract

The tight span of a finite metric space is essentially the ‘smallest’ path geodesic space into which the metric space embeds isometrically. In this situation, the tight span is also contractible and has a natural cell structure, so that it lends itself naturally to the study of the Cayley graph of a group. As a first step in this study, we consider the tight span of a metric space which arises from the graph metric of an antipodal graph. In particular, we develop techniques for the study of the tight span of a graph, which we then apply to antipodal graphs. In this way, we are able to find the polytopal structure of the tight span for special examples of antipodal graphs. Finally, we present computer generated examples of tight spans which were made possible by the techniques developed in this paper.

Item Type:	Article
Faculty \ School:	Faculty of Science > School of Computing Sciences
UEA Research Groups:	Faculty of Science > Research Groups > Computational Biology > Computational biology of RNA (former - to 2018) Faculty of Science > Research Groups > Computational Biology > Phylogenetics (former - to 2018) Faculty of Science > Research Groups > Computational Biology Faculty of Science > Research Groups > Norwich Epidemiology Centre Faculty of Medicine and Health Sciences > Research Groups > Norwich Epidemiology Centre
Depositing User:	Vishal Gautam
Date Deposited:	13 Jun 2011 14:02
Last Modified:	16 Jun 2023 23:50
URI:	https://ueaeprints.uea.ac.uk/id/eprint/23281
DOI:	10.1016/S0012-365X(99)00337-4

Actions (login required)

View Item