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

关于图的平方的边连通性

On the Edge-Connectivity of the Square of a Graph

Camino Balbuena, Peter Dankelmann

AI总结:

本文研究图的平方的边连通性,给出了极大边连通的最小度充分条件及非极大情形下的两个紧下界,并证明下界的最优性。

摘要:

设$G$为连通图。$G$的边连通性记为$λ(G)$,是指使$G$变为不连通所需移除的最少边数。设$δ(G)$为$G$的最小度。众所周知$λ(G) \leq δ(G)$,等号成立的图被称为极大边连通图。$G$的平方$G^2$是与$G$具有相同顶点集的图,其中两个顶点相邻当且仅当它们的距离不超过2。\n 本文给出了图的平方的边连通性相关结果。我们证明:若阶数为$n$的连通图$G$的最小度至少为$\lfloor \frac{n+2}{4}\rfloor$,则$G^2$是极大边连通图,且该结果是最优的。我们还给出了$G^2$非极大边连通时$λ(G^2)$的下界:证明了$λ(G^2) \geq κ(G)^2 + κ(G)$,其中$κ(G)$表示$G$的连通度,即移除后使$G$不连通的最少顶点数,且该界是紧的。我们进一步证明$λ(G^2) \geq \frac{1}{2}λ(G)^{3/2} - \frac{1}{2} λ(G)$,并构造了一族无穷多图,证明该界中$λ(G)$的指数$3/2$是最优的。

英文摘要:

Let $G$ be a connected graph. The edge-connectivity of $G$, denoted by $λ(G)$, is the minimum number of edges whose removal renders $G$ disconnected. Let $δ(G)$ be the minimum degree of $G$. It is well-known that $λ(G) \leq δ(G)$, and graphs for which equality holds are said to be maximally edge-connected. The square $G^2$ of $G$ is the graph with the same vertex set as $G$, in which two vertices are adjacent if their distance is not more that $2$. In this paper we present results on the edge-connectivity of the square of a graph. We show that if the minimum degree of a connected graph $G$ of order $n$ is at least $\lfloor \frac{n+2}{4}\rfloor$, then $G^2$ is maximally edge-connected, and this result is best possible. We also give lower bounds on $λ(G^2)$ for the case that $G^2$ is not maximally edge-connected: We prove that $λ(G^2) \geq κ(G)^2 + κ(G)$, where $κ(G)$ denotes the connectivity of $G$, i.e., the minimum number of vertices whose removal renders $G$ disconnected, and this bound is sharp. We further prove that $λ(G^2) \geq \frac{1}{2}λ(G)^{3/2} - \frac{1}{2} λ(G)$, and we construct an infinite family of graphs to show that the exponent $3/2$ of $λ(G)$ in this bound is best possible.

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

↑