On Cyclic Edge-Connectivity and Super-Cyclic Edge-Connectivity of Double-Orbit Graphs
On Cyclic Edge-Connectivity and Super-Cyclic Edge-Connectivity of Double-Orbit Graphs
复制标题
DOI：
10.1007/s40840-015-0286-y
复制
发表时间：
2016
期刊：
影响因子：
--
通讯作者：
陈美润
中科院分区：
文献类型：
--
作者：
Weihua Yang;覃城阜;陈美润
A cyclic edge-cut of a graph G is an edge set, the removal of which.separates two cycles. If G has a cyclic edge-cut, then it is said to be cyclically.separable. For a cyclically separable graph G, the cyclic edge-connectivity.λc(G) is the cardinality of a minimum cyclic edge-cut of G. Let ζ(G) =.min{ω(X)|X induce a shortest cycle in G}, where ω(X) is the number of edges with.one end in X and the other end in V(G) − X. A cyclically separable graph G with.λc(G) = ζ(G) is said to be cyclically optimal. In particular, we call a graph G super.cyclically edge-connected if every minimum cyclic edge-cut isolates a shortest cycle.of G. In this work, we first discuss the cyclic edge-connectivity of vertex transitive.graphs, regular double-orbit graphs, and the double-orbit graphs with two orbits of.same size; moreover, we also discuss the super-cyclic edge-connectivity of doubleorbit.graphs mentioned above.
