Sökning: id:"swepub:oai:DiVA.org:uu-71826" >
The relation graph
The relation graph
-
- Huber, K. T. (författare)
- Institute of Fundamental Sciences, Massey University, Private Bag 11 222, Palmerston North, New Zealand
-
- Moulton, Vincent (författare)
- Mittuniversitetet,Uppsala universitet,Centrum för bioinformatik,Institutionen för teknik, fysik och matematik (-2008)
-
(creator_code:org_t)
- 2002
- 2002
- Engelska.
-
Ingår i: Discrete Mathematics. - 0012-365X .- 1872-681X. ; 244:1-3, s. 153-166
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://urn.kb.se/re...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- Given a set R of distinct, non-trivial partitions of a finite set, we define the relation graph G(R) of R. In case R consists only of bipartitions, G(R) is the well-known Buneman graph, a median graph that has applications in the area of phylogenetic analysis., Here we consider properties of the relation graph for general sets of partitions and, in particular, we see that it mimics the behaviour of the Buneman graph by proving the following two theorems:(i) The graph G(R) is a Hamming graph if and only if R is strongly incompatible.(ii) The graph G(R) is a block graph with #R blocks if and only if R is strongly compatible.
Ämnesord
- NATURVETENSKAP -- Matematik (hsv//swe)
- NATURAL SCIENCES -- Mathematics (hsv//eng)
Nyckelord
- median graphs
- networks
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
Till lärosätets databas