Upper bound of the third edge-connectivity of graphs
Upper bound of the third edge-connectivity of graphs
复制标题
DOI：
10.1360/03ys0254
复制
发表时间：
2005-03
影响因子：
1.4
通讯作者：
Wang Yingqian Li Qiao
中科院分区：
文献类型：
--
作者：
Wang Yingqian Li Qiao
设G是阶数n≤ 6的简单连通图. G的第三边连通度定义为G的所有边集上的最小基数，如果有的话，其删除断开G，并且所得图的每个分量至少有3个顶点。本文首先刻画了第三边连通度定义明确的图，然后建立了第三边连通度的紧上界。
Let G be a simple connected graph of order n≤ 6. The third edge-connectivity of G is defined as the minimum cardinality over all the sets of edges, if any, whose deletion disconnects G and every component of the resulting graph has at least 3 vertices. In this paper, we first characterize those graphs whose third-edge connectivity is well defined, then establish the tight upper bound for the third edge-connectivity.