Pairwise Compatibility Graphs of Caterpillars

Abstract

A graph G 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 leaf lu of T corresponds to a vertex u ∈ V and there is an edge (u, v) ∈ E if and only if dmin ≤ dT,w(lu, lv) ≤ dmax where dT,w(lu, lv) is the sum of the weights of the edges on the unique path from… (More)
DOI: 10.1093/comjnl/bxt068

Topics

2 Figures and Tables

Slides referencing similar topics