On the phylogeny graphs of degree-bounded digraphs

Hefner et al. (1991) characterized acyclic digraphs each vertex of which has indegree and outdegree at most two and whose competition graphs are interval. They called acyclic digraphs each vertex of which has indegree and outdegree at most two (2,2) digraphs. In this paper, we study the phylogeny graphs of (2,2) digraphs. Especially, we give a sufficient condition and necessary conditions for (2,2) digraphs having chordal phylogeny graphs. Phylogeny graphs are also called moral graphs in Bayesian network theory. Our work is motivated by problems related to evidence propagation in a Bayesian network for which it is useful to know which acyclic digraphs have their moral graphs being chordal.