Abstract
Pairwise compatibility graphs (PCGs) with non-negative integer edge weights recently have been used to describe rare evolutionary events and scenarios with horizontal gene transfer. Here we consider the case that vertices are separated by exactly two discrete events: Given a tree T with leaf set L and edge-weights λ:E(T)→N0, the non-negative integer pairwise compatibility graph nniPCG(T,λ,2,2) has vertex set L and xy is an edge whenever the sum of the non-negative integer weights along the unique path from x to y in T equals 2. A graph G has a representation as nniPCG(T,λ,2,2) if and only if its point-determining quotient ▪ is a block graph, where two vertices are in relation ▪ if they have the same neighborhood in G. If G is of this type, a labeled tree (T,λ) explaining G can be constructed efficiently. In addition, we consider an oriented version of this class of graphs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
