arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2401.15549math.CO
收藏

强乘积图的限制边连通度

The Restricted Edge-Connectivity of Strong Product Graphs

Hazhe Ye, Yingzhi Tian

AI总结:

本文研究强乘积图的限制边连通度,确定了任意图与路径、圈、完全图的强乘积的限制边连通度,并给出其为极大、超限制边连通图的充分条件。

摘要:

连通图$G$的限制边连通度(若存在)记为$\lambda^{\prime}(G)$,指的是删除后会使$G$不连通且每个连通分量至少包含2个顶点的边集的最小基数。已有研究证明,若$G$不是星图且$|V(G)|\geq4$,则$\lambda^{\prime}(G)$存在,且满足$\lambda^{\prime}(G)\leq\xi(G)$,其中$\xi(G)$是$G$的最小边度。据此,若$\lambda^{\prime}(G)=\xi(G)$,则称图$G$是极大限制边连通的;若每个最小限制边割都孤立出$G$的一条边,则称$G$是超限制边连通的。图$G$与$H$的强乘积记为$G\boxtimes H$,其顶点集为$V(G)\times V(H)$,边集为$\{(x_1,y_1)(x_2,y_2)\\ |\\ x_1=x_2$且$y_1y_2\in E(H)$;或$y_1=y_2$且$x_1x_2\in E(G)$;或$x_1x_2\in E(G)$且$y_1y_2\in E(H)\}$。本文针对任意非平凡连通图$G$,确定了$G\boxtimes P_n$、$G\boxtimes C_n$和$G\boxtimes K_n$的限制边连通度,其中$P_n$、$C_n$、$K_n$分别为$n$个顶点的路径、圈和完全图。作为推论,本文给出了上述三类强乘积图$G\boxtimes P_n$、$G\boxtimes C_n$和$G\boxtimes K_n$成为极大限制边连通图与超限制边连通图的充分条件。

英文摘要:

The restricted edge-connectivity of a connected graph $G$, denoted by $λ^{\prime}(G)$, if it exists, is the minimum cardinality of a set of edges whose deletion makes $G$ disconnected and each component with at least 2 vertices. It was proved that if $G$ is not a star and $|V(G)|\geq4$, then $λ^{\prime}(G)$ exists and $λ^{\prime}(G)\leqξ(G)$, where $ξ(G)$ is the minimum edge-degree of $G$. Thus a graph $G$ is called maximally restricted edge-connected if $λ^{\prime}(G)=ξ(G)$; and a graph $G$ is called super restricted edge-connected if each minimum restricted edge-cut isolates an edge of $G$. The strong product of graphs $G$ and $H$, denoted by $G\boxtimes H$, is the graph with vertex set $V(G)\times V(H)$ and edge set $\{(x_1,y_1)(x_2,y_2)\ |\ x_1=x_2$ and $y_1y_2\in E(H)$; or $y_1=y_2$ and $x_1x_2\in E(G)$; or $x_1x_2\in E(G)$ and $y_1y_2\in E(H)$\}. In this paper, we determine, for any nontrivial connected graph $G$, the restricted edge-connectivity of $G\boxtimes P_n$, $G\boxtimes C_n$ and $G\boxtimes K_n$, where $P_n$, $C_n$ and $K_n$ are the path, the cycle and the complete graph on $n$ vertices, respectively. As corollaries, we give sufficient conditions for these strong product graphs $G\boxtimes P_n$, $G\boxtimes C_n$ and $G\boxtimes K_n$ to be maximally restricted edge-connected and super restricted edge-connected.

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

↑