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

某些图(超)类的两两相容性

On Pairwise Compatibility of Some Graph (Super)Classes

Tiziana Calamoneri, Blerina Sinaimeri, Mattia Gastaldello

摘要:

图G=(V,E)是成对相容图(PCG),如果存在边权树T和两个非负实数d和D,使得T的每个叶子u是V的一个结点,边u,v属于E当且仅当d <= d_T(u,v)<= D',其中d_T(u,v)<= D',v)是T中从“u”到“v”的唯一路径上的边的权重之和。这些图的主要问题在于表征它们。本文证明了PCG类中包含阈值容差图,不包含一些交图,如圆盘与网格交图、圆弧与容差图。不包括一些超类(梯形,排列和矩形交叉图)如下。

英文摘要:

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 `d' and `D' such that each leaf `u' of T is a node of V and the edge `(u,v) belongs to E' iff `d <= d_T(u, v) <= D' where d_T(u, v) is the sum of weights of the edges on the unique path from `u' to `v' in T. The main issue on these graphs consists in characterizing them. In this note we prove the inclusion in the PCG class of threshold tolerance graphs and the non-inclusion of a number of intersection graphs, such as disk and grid intersection graphs, circular arc and tolerance graphs. The non-inclusion of some superclasses (trapezoid, permutation and rectangle intersection graphs) follows.

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

↑