arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1105.2171cs.DM
收藏

关于放松两两相容图中的约束

On relaxing the constraints in pairwise compatibility graphs

Tiziana Calamoneri, Rossella Petreschi, Blerina Sinaimeri

摘要:

一个图$G$称为成对相容图(PCG),如果存在一个边权树$T$和两个非负实数$d_{min}$和$d_{max}$,使得$T$的每个叶$l_u$对应于一个顶点$u \in V$,并且存在边$(u,v) \in E$当且仅当$d_{min} \leq d_T (l_u, l_v) \leq d_{max}$其中$d_T (l_u, l_v)$是$T$中从$l_u$到$l_v$的唯一路径上的边的权和.在本文中,我们分析了PCG类与两个特殊的子类的关系,从$\dmin=0$(LPG)和$\dmax=+\infty$(mLPG)的情况下,$\dmax=+\infty$(mLPG)。特别是,我们表明,LPG和mLPG的工会不符合整个类PCG,它们的交集不是空的,并且LPG和mLPG类都不包含在其他。最后,由于我们处理的图属于更一般的分裂母源图类,我们专注于这一类图,我们试图建立的PCG类的成员。

英文摘要:

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 $l_u$ of $T$ corresponds to a vertex $u \in V$ and there is an edge $(u,v) \in E$ if and only if $d_{min} \leq d_T (l_u, l_v) \leq d_{max}$ 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 $\dmin=0$ (LPG) and $\dmax=+\infty$ (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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑