| 具有两个同阶轨道的双轨道图的圈边连通度 |
| |
| 引用本文： | 林辉球,杨卫华,孟吉翔. 具有两个同阶轨道的双轨道图的圈边连通度[J]. 数学研究, 2010, 43(3): 233-241 |
| |
| 作者姓名： | 林辉球 杨卫华 孟吉翔 |
| |
| 作者单位： | 1. 新疆大学数学与系统科学学院,新疆乌鲁木齐,830046
2. 厦门大学数学科学学院,福建厦门,361005 |
| |
| 基金项目： | supported by NSFC（No.10671165） |
| |
| 摘 要： | 一个边割被称为圈边割,如果该边割能分离图的两个不同圈.如果一个图有圈边割,称该图为圈边可分离的.一个圈边可分离图G的最小圈边割的阶数被称为圈边连通度,记作cλ（G）.定义：ζ（G）=min{w（X）｜X导出G的最短圈},其中w（X）为端点分别在X和V（G）-X中的边的数目.如果一个圈边可分离图G使得cλ（G）=ζ（G）成立,称该图是圈边最优的.Tian和Meng在文章[11]以及Yang et al在文章[15]中研究了两种不同的双轨道图的圈边最优性.本文我们将研究具有两个同阶轨道的双轨道图的圈边连通度.
|
| 关 键 词： | 圈边连通度 圈边最优 轨道 |
On Cyclic Edge Connectivity of Graphs with Two Orbits of Same Size |
| |
| Lin Huiqiu,Yang Weihua,Meng Jixiang. On Cyclic Edge Connectivity of Graphs with Two Orbits of Same Size[J]. Journal of Mathematical Study, 2010, 43(3): 233-241 |
| |
| Authors: | Lin Huiqiu Yang Weihua Meng Jixiang |
| |
| Affiliation: | Lin Huiqiu Yang Weihua Meng Jixiang (1.College of Mathematics and Systems Science.Xinjiang University,Urumqi Xinjiang 830046; 2.School of Mathematical Science,Xiamen University,Xiamen Fujian361005) |
| |
| Abstract: | 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 induces a shortest cycle in G},where ω(X)is the number of the edge with one end in X and the other one in V(G)-X.A cyclically separable graph G with cλ(G)= ζ(G)is said to be cyclically optimal.Tian and Meng in[11]and Yang et al in[15]studied the cyclically optimality of two kinds of double orbits graphs.In this work,we discuss the cyclic edge connectivityof graphs with two orbits of same size. |
| |
| Keywords: | cyclic edge-connectivity orbit cyclically optimal |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
