SwePub
Sök i SwePub databas

  Extended search

Träfflista för sökning "id:"swepub:oai:DiVA.org:uu-71826" "

Search: id:"swepub:oai:DiVA.org:uu-71826"

  • Result 1-1 of 1
Sort/group result
   
EnumerationReferenceCoverFind
1.
  • Huber, K. T., et al. (author)
  • The relation graph
  • 2002
  • In: Discrete Mathematics. - 0012-365X .- 1872-681X. ; 244:1-3, s. 153-166
  • Journal article (peer-reviewed)abstract
    • 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.
  •  
Skapa referenser, mejla, bekava och länka
  • Result 1-1 of 1
Type of publication
journal article (1)
Type of content
peer-reviewed (1)
Author/Editor
Moulton, Vincent (1)
Huber, K. T. (1)
University
Uppsala University (1)
Mid Sweden University (1)
Language
English (1)
Research subject (UKÄ/SCB)
Natural sciences (1)
Year
2002 (1)

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view