The phylogeny graphs of doubly partial orders

From MaRDI portal



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) of a digraph D is the (simple undirected) graph defined by V(P(D)):=V(D) and E(P(D)):=xymidND+(x)capND+(y)eqemptysetcupxymid(x,y)inA(D), where ND+(x):=vinV(D)mid(x,v)inA(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 G, there exists an interval graph ildeG such that ildeG contains the graph G as an induced subgraph and that ildeG is the phylogeny graph of a doubly partial order.












This page was built for publication: The phylogeny graphs of doubly partial orders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5495048)