[Paper Review] Circles and Paths in 2-Colored Best Match Graphs

Annachiara Korchmaros|arXiv (Cornell University)|Jun 7, 2020

Advanced Graph Theory Research13 references4 citations

TL;DR

This paper investigates structural properties of 2-colored best match graphs (2-cBMGs), a class of directed bipartite graphs derived from rooted phylogenetic trees, focusing on cycles and paths under three key axioms: N(1), N(2), and N(3). It establishes that under N(2), the quotient graph contains long directed paths, and under N(1) and N(3), the structure exhibits a hierarchy where reachable sets are nested or disjoint, providing a graph-theoretic foundation for evolutionary inference in computational biology.

ABSTRACT

Recent investigations in computational biology focus on a family of 2-colored digraphs, called 2-colored best match graphs, which naturally arise from rooted phylogenetic trees. Actually the defining properties of such graphs are unexpectedly unusual in graph theory, and they were established only recently after the discovery of their links to evolutionary relatedness via phylogenetic trees. In this paper several results are obtained on 2-colored best match graphs which well fit in the mainstream of graph theory.

Motivation & Objective

• To characterize the structural properties of 2-colored best match graphs (2-cBMGs) derived from rooted phylogenetic trees.
• To investigate how axioms N(1), N(2), and N(3) influence the existence and structure of directed paths and cycles in 2-cBMGs.
• To establish a hierarchy property in 2-cBMGs satisfying N(1), N(2), and N(3), ensuring reachable sets are nested or disjoint.
• To connect novel graph-theoretic properties—particularly N(2) and N(3)—to classical results in directed graph theory and their relevance in computational biology.

Proposed method

• The study analyzes 2-cBMGs as oriented, bipartite digraphs with vertex coloring based on a surjective color map from leaf sets of rooted phylogenetic trees.
• It applies the axioms N(1), N(2), and N(3) to derive structural constraints on out-neighbors, in-neighbors, and reachability in the graph.
• The quotient graph of a 2-cBMG is constructed by collapsing equivalent vertices (same in- and out-neighbors), enabling analysis of path structures in the reduced graph.
• Directed paths and circuits are analyzed using strong connectivity and trail definitions, with emphasis on length and existence under given axioms.
• The paper uses proof techniques involving contradiction and inclusion relations (e.g., N(N(u)) ⊆ N(u)) to derive implications of the axioms.
• It compares results to classical graph theory, particularly bitransitive and acyclic oriented digraphs, and applies results from [7] on cBMG characterization.

Experimental results

Research questions

• RQ1 Under what conditions do 2-cBMGs contain long directed paths, and how does the N(2) property influence this?
• RQ2 How do the axioms N(1), N(2), and N(3) collectively enforce a hierarchy in the reachable sets of vertices in 2-cBMGs?
• RQ3 What is the role of symmetric edges and vertex domination in the structure of 2-cBMGs satisfying N(3)?
• RQ4 Can the hierarchy property—where reachable sets are nested or disjoint—be derived from N(1), N(2), and N(3), and how does it relate to path existence?
• RQ5 How do the graph-theoretic properties of 2-cBMGs, especially N(2), align with classical results in directed graph theory?

Key findings

• The quotient graph of a 2-cBMG satisfying N(2) contains a directed path of length at least 3 when the number of vertices with no in- or out-neighbors is small, indicating long reachability chains.
• Under N(1) and N(2), if two vertices are independent and have no common out-neighbors, then neither can be strongly connected to a common third vertex, enforcing structural constraints.
• The hierarchy property holds for 2-cBMGs satisfying N(1), N(2), and N(3): for any two vertices, their reachable sets R(α) and R(β) are either nested or disjoint.
• When N(2) and N(3) hold, any two non-equivalent vertices with a common out-neighbor and no length-2 path between them must have at least one that is not an endpoint of a symmetric edge.
• The oriented version of the 2-cBMG, obtained by removing symmetric edges, is acyclic and supports longer directed paths when the sum of vertices with no in- or out-neighbors is sufficiently large.
• In the example from [7, Fig. 7A], the graph contains a directed path of length 4, and the hierarchy property ensures that reachable sets from α₅ and α₆ are nested or disjoint, consistent with the axioms.