arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1708.01272math.CO
收藏

唯一可表示图的一个刻划

A Characterization of Uniquely Representable Graphs

Péter G. N. Szabó

摘要:

有限度量空间$M = (X, d)$的介数结构是一对$\mathcal{B}(M) = (X,β_M)$,其中$β_M$是由点三元组$(x, y, z)$组成的$M$的所谓介数关系,使得$d(x, z) = d(x, y) + d(y, z)$。介数结构$\mathcal{B} = (X,β)$的基础图是简单图$G(\mathcal{B}) = (X, E)$,其中边是不同点对,它们之间没有第三点。一个连通图$G$是唯一可表示的,如果存在一个唯一的度量介数结构,其基础图是$G$ .以前的作品暗示树是唯一可表示的。本文给出了唯一可表示图的一个刻划,证明了它们是块图。进一步证明了两类相关的图分别与块图类和距离遗传图类重合。我们表明,我们的结果不仅适用于度量,但也几乎度量介数结构。

英文摘要:

The betweenness structure of a finite metric space $M = (X, d)$ is a pair $\mathcal{B}(M) = (X,β_M)$ where $β_M$ is the so-called betweenness relation of $M$ that consists of point triplets $(x, y, z)$ such that $d(x, z) = d(x, y) + d(y, z)$. The underlying graph of a betweenness structure $\mathcal{B} = (X,β)$ is the simple graph $G(\mathcal{B}) = (X, E)$ where the edges are pairs of distinct points with no third point between them. A connected graph $G$ is uniquely representable if there exists a unique metric betweenness structure with underlying graph $G$. It was implied by previous works that trees are uniquely representable. In this paper, we give a characterization of uniquely representable graphs by showing that they are exactly the block graphs. Further, we prove that two related classes of graphs coincide with the class of block graphs and the class of distance-hereditary graphs, respectively. We show that our results hold not only for metric but also for almost-metric betweenness structures.

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

↑