On relaxing the constraints in pairwise compatibility graphs

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

d_{m i n}

and

d_{m a x}

such that each leaf

l_{u}

of

T

corresponds to a vertex

u i n V

and there is an edge

(u, v) i n E

if and only if

d_{m i n} l e q d_{T} (l_{u}, l_{v}) l e q d_{m a x}

where

d_{T} (l_{u}, l_{v})

is the sum of the weights of the edges on the unique path from

l_{u}

to

l_{v}

in

T

. In this paper we analyze the class of PCG in relation with two particular subclasses resulting from the the cases where

d m i n = 0

(LPG) and

d m a x = + i n f t y

(mLPG). In particular, we show that the union of LPG and mLPG does not coincide with the whole class PCG, their intersection is not empty, and that neither of the classes LPG and mLPG is contained in the other. Finally, as the graphs we deal with belong to the more general class of split matrogenic graphs, we focus on this class of graphs for which we try to establish the membership to the PCG class.

Recommendations

Cited in

(14)

This page was built for publication: On relaxing the constraints in pairwise compatibility graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2889906)