DeepAI AI Chat
Log In Sign Up

New Results on Pairwise Compatibility Graphs

by   Sheikh Azizul Hakim, et al.

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 d_min and d_max such that each leaf u of T corresponds to a vertex u ∈ V and there is an edge (u, v) ∈ E if and only if d_min≤ d_T(u, v) ≤ d_max, where d_T(u, v) is the sum of the weights of the edges on the unique path from u to v in T. The tree T is called the pairwise compatibility tree (PCT) of G. It has been proven that not all graphs are PCGs. Thus, it is interesting to know which classes of graphs are PCGs. In this paper, we prove that grid graphs are PCGs. Although there are a necessary condition and a sufficient condition known for a graph being a PCG, there are some classes of graphs that are intermediate to the classes defined by the necessary condition and the sufficient condition. In this paper, we show two examples of graphs that are included in these intermediate classes and prove that they are not PCGs.


page 1

page 2

page 3

page 4


Some Reduction Operations to Pairwise Compatibility Graphs

A graph G=(V,E) with a vertex set V and an edge set E is called a pairwi...

A Weak Compatibility Condition for Newest Vertex Bisection in any dimension

We define a weak compatibility condition for the Newest Vertex Bisection...

On Generalizations of Pairwise Compatibility Graphs

A graph G is a PCG if there exists an edge-weighted tree such that each ...

Characterizing Star-PCGs

A graph G is called a pairwise compatibility graph (PCG, for short) if i...

On the total variation regularized estimator over a class of tree graphs

We generalize to tree graphs obtained by connecting path graphs an oracl...

Stochastic dynamic matching: A mixed graph-theory and linear-algebra approach

The stochastic dynamic matching problem has recently drawn attention in ...

Budgeted Steiner Networks: Three Terminals with Equal Path Weights

Given a set of terminals in 2D/3D, the network with the shortest total l...