On the number of vertices and edges of the Buneman graph
- 138 Downloads
In 1971, Peter Buneman proposed a way to construct a tree from a collection of pairwise compatible splits. This construction immediately generalizes to arbitrary collections of splits, and yields a connected median graph, called the Buneman graph. In this paper, we prove that the vertices and the edges of this graph can be described in a very simple way: given a collection of splitsS, the vertices of the Buneman graph correspond precisely to the subsetsS′ ofS such that the splits inS′ are pairwise incompatible and the edges correspond to pairs (S′, S) withS′ as above andS∈S′. Using this characterization, it is much more straightforward to construct the vertices of the Buneman graph than using prior constructions. We also recover as an immediate consequence of this enumeration that the Buneman graph is a tree, that is, that the number of vertices exceeds the number of edges (by one), if and only if any two distinct splits inS are compatible.
AMS Subject Classification05C99 05C05 04A03 03E05 92B99
KeywordsBuneman graphs split systems split decompositon phylogenetic networks phylogenetic trees median networks hypercubes compatibility of taxonomic characters
Unable to display preview. Download preview PDF.
- 1.H.-J. Bandelt, Phylogenetic networks, Verh. Naturwiss. Ver. Hamburg34 (1991) 51–57.Google Scholar
- 3.P. Buneman, The recovery of trees from measures of dissimilarity, In: Mathematics in the Archeological and Historical Sciences, F. Hodson et al., Eds., Edinburgh University Press, 1971, pp. 387–395.Google Scholar
- 5.J. Barthelemy and A. Guenoche, Trees and Proximity Representations, John Wiley, 1991.Google Scholar