Просмотр кода страницы Phylogeny digraph

'''Phylogeny digraph''' --- филогенный орграф. 

Given a graph <math>G = (V,E)</math>, the acyclic digraph <math>D</math> is a '''phylogeny digraph''' for <math>G</math> if <math>G</math> is an induced subgraph of a ''phylogeny graph'' <math>P(D)</math> and <math>D</math> has no arcs from vertices outside of <math>G</math> to
vertices in <math>G</math>.

The ''' phylogeny number''' <math>p(G)</math> is defined to be the smallest <math>r</math>
such that <math>G</math> has a phylogeny digraph <math>D</math> with <math>|V(D) - V(G)| = r</math>.