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

顶点数不超过7的图都是成对相容图

All graphs with at most seven vertices are Pairwise Compatibility Graphs

Tiziana Calamoneri, Dario Frascaria, Blerina Sinaimeri

摘要:

一个图$G$称为成对相容图(PCG),如果存在一个边加权树$T$和两个非负实数$d_{min}$和$d_{max}$,使得$T$的每个叶$l_u$对应一个顶点$u \in V$,并且存在边$(u,v) \in E$当且仅当$d_{min} \leq d_{T,w} (l_u, l_v) \leq d_{max}$,其中$d_{T,w} (l_u, l_v)$是$T$中从$l_u$到$l_v$的唯一路径上的边的权和.本文证明了顶点数不超过7的图都是PCG。特别地,除了7个顶点上的轮$W_7$之外,所有这些图都是树的特定结构的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,w} (l_u, l_v) \leq d_{max}$ where $d_{T,w} (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 note, we show that all the graphs with at most seven vertices are PCGs. In particular all these graphs except for the wheel on 7 vertices $W_7$ are PCGs of a particular structure of a tree: a centipede.

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

↑