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 gr...

Full description

Saved in:
Bibliographic Details
Published inDiscrete Applied Mathematics Vol. 233; pp. 83 - 93
Main Authors Lee, Seung Chul, Choi, Jihoon, Kim, Suh-Ryung, Sano, Yoshio
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 31.12.2017
Elsevier BV
Subjects
[formula omitted] digraph
Applied mathematics
Bayesian analysis
Chordal graph
Competition graph
Diagrams
Graph theory
Graphs
Moral graph
Phylogeny graph
(2,2) digraph
Chordal graph
Moral graph
Phylogeny graph
Competition graph
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2017.07.018