The phylogeny graphs of doubly partial orders

preprint2013arXivOpen access

Abstract

The competition graph of a doubly partial order is known to be an interval graph. The CCE graph and the niche graph of a doubly partial order are also known to be interval graphs if the graphs do not contain a cycle of length four and three as an induced subgraph, respectively. Phylogeny graphs are variant of competition graphs. The phylogeny graph P(D)P(D) of a digraph DD is the (simple undirected) graph defined by V(P(D)):=V(D)V(P(D)):=V(D) and E(P(D)):={xy∣ND+(x)∩ND+(y)≠∅}∪{xy∣(x,y)∈A(D)}E(P(D)):=\{xy \mid N^+_D(x) \cap N^+_D(y) \neq \emptyset \} \cup \{xy \mid (x,y) \in A(D) \}, where ND+(x):={v∈V(D)∣(x,v)∈A(D)}N^+_D(x):=\{v \in V(D) \mid (x,v) \in A(D)\}. In this note, we show that the phylogeny graph of a doubly partial order is an interval graph. We also show that, for any interval graph GG, there exists an interval graph G~\tilde{G} such that G~\tilde{G} contains the graph GG as an induced subgraph and that G~\tilde{G} is the phylogeny graph of a doubly partial order.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.