A graph G=(V,E) is a pairwise compatibility graph (PCG) if there exists an edge-weighted
tree T and two nonnegative real numbers d_min and d_max such that each leaf u of T is a …

A graph G is called a pairwise compatibility graph (PCG) if there exists an edge-weighted
tree T and two non-negative real numbers d min and d max such that each leaf lu of T …

Let T be an edge weighted tree and dmin, dmax be two non-negative real numbers where d
min≤ d max. The pairwise compatibility graph (PCG) of T for dmin, dmax is a graph G such …

A graph is called a pairwise compatibility graph (PCG) if it admits a tuple of an edge-
weighted tree of non-negative edge weights with leaf set, two non-negative real numbers …

A graph G is called a pairwise compatibility graph (PCG, for short) if it admits a tuple (T, w,
d_\min, d_\max)(T, w, d min, d max) of a tree T whose leaf set is equal to the vertex set of G …

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 …

Abstract Azam et al.(2018) proposed a method to enumerate all pairwise compatibility
graphs (PCGs) with a given number n of vertices. For a tuple (G, T, σ, λ) of a graph G with n …

Abstract A graph G=(V, E) is called a pairwise compatibility graph (PCG) if there exists an
edge-weighted tree T and two non-negative real numbers dmin and dmax such that each …

A k-leaf power of a tree T is a graph G whose vertices are the leaves of T and whose edges
connect pairs of leaves whose distance in T is at most k. A graph is a leaf power if it is ak-leaf …

Abstract A graph G=(V, E) is a pairwise compatibility graph (PCG) if there exists an edge-
weighted tree T and two non-negative real numbers dmin and dmax, dmin≤ dmax, such that …