On the phylogeny graphs of degree-bounded digraphs

TL;DR

This paper investigates the conditions under which the phylogeny (moral) graphs of degree-bounded acyclic digraphs, specifically (2,2) digraphs, are chordal, aiding Bayesian network evidence propagation.

Contribution

It provides necessary and sufficient conditions for (2,2) digraphs to have chordal phylogeny graphs, advancing understanding of their structure in Bayesian networks.

Findings

Identified conditions for chordality in phylogeny graphs of (2,2) digraphs

Characterized when these graphs are chordal based on digraph properties

Enhanced understanding of moral graphs in Bayesian network theory

Abstract

Hefner [K. A. S. Hefner, K. F. Jones, S. -R. Kim, R. J. Lundgren and F. S. Roberts: $(i,j)$ competition graphs, Discrete Applied Mathematics, 32, (1991) 241-262] characterized acyclic digraphs each vertex of which has inderee and outdegree at most two and whose competition graphs are interval. They called acyclic digraphs each vertex of which has inderee 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.