图的邻近集与连通性
Proximinal sets and connectedness in graphs
摘要:
设$G$是一个顶点集为$V$的图.图$G$是路径邻近的,如果存在半度量空间$d \colon V \times V \to [0, \infty[$和半度量空间$(V, d)$的不相交邻近子集,使得$V = A \cup B$和顶点$u$,$v \in V$相邻当且仅当\[ d(u, v) \leqslant \inf \{d(x, y) \colon x \in A, y \in B\}, \]且对于每个$p \in V$,存在连接$G$中的$A$和$B$且穿过$p$的路径。证明了一个图是路逼近的当且仅当它的所有顶点不是孤立的。证明了一个图对于一个超度量同时是逼近的和路逼近的当且仅当它的每个顶点的度都等于$1$。
英文摘要:
Let $G$ be a graph with a vertex set $V$. The graph $G$ is path-proximinal if there are a semimetric $d \colon V \times V \to [0, \infty[$ and disjoint proximinal subsets of the semimetric space $(V, d)$ such that $V = A \cup B$, and vertices $u$, $v \in V$ are adjacent iff \[ d(u, v) \leqslant \inf \{d(x, y) \colon x \in A, y \in B\}, \] and, for every $p \in V$, there is a path connecting $A$ and $B$ in $G$, and passing through $p$. It is shown that a graph is path-proximinal if and only if all its vertices are not isolated. It is also shown that a graph is simultaneously proximinal and path-proximinal for an ultrametric if and only if the degree of every its vertex is equal to $1$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。