圈的笛卡积的圈点连通度（英文）

秦德金; 田应智; 孟吉翔

doi:10.13568/j.cnki.651094.2017.04.007

您当前的位置：

首页 >

文章列表页 >

圈的笛卡积的圈点连通度（英文）

数理科学 | 更新时间：2026-01-21

- 圈的笛卡积的圈点连通度（英文）
- 圈的笛卡积的圈点连通度（英文）
- 新疆大学学报（自然科学版中英文） 2017年34卷第4期页码：415-420
- 作者机构：
  
  新疆大学数学与系统科学学院
- 作者简介：
- 基金信息：
  
  supported by NSFC(11531011,11401510);the Key Laboratory Project of Xinjiang(2015KL019)
- DOI：10.13568/j.cnki.651094.2017.04.007
  中图分类号： O157.5
- 纸质出版：2017
- 稿件说明：
移动端阅览
[1]秦德金,田应智,孟吉翔.圈的笛卡积的圈点连通度（英文）[J],2017,34(04):415-420.
[1]秦德金,田应智,孟吉翔.圈的笛卡积的圈点连通度（英文）[J],2017,34(04):415-420. DOI： 10.13568/j.cnki.651094.2017.04.007.

DOI：10.13568/j.cnki.651094.2017.04.007.

摘要

设G是一个点集为V(G)

边集为E(G)的图.对于图G的点子集S

如果G-S不连通并且至少两个连通分支包含圈

则称S为一个圈点割.如果一个图有圈点割

称该图为圈可分离的.一个圈点可分离图G的最小圈点割的阶数被称为圈点连通度

记作κc(G).文章证明了κc(C3□Cn1□Cn2□···□Cnk)=6k和κc(Cn1□Cn2□···Cnk)=8k-8

其中对于i=1

···

Cni是一个长度大于等于4的圈.

Abstract

Let G be a graph with vertex set V(G) and edge set E(G).A vertex subset S?V(G) is called a cyclic vertex-cut if G-S is disconnected and at least two components of G-S contain cycles.If G has a cyclic vertex-cut

then it is said to be cyclically separable.For a cyclically separable graph G

the cyclic vertex-connectivity of a connected graph G

denoted by κc(G)

is defined as the minimum cardinality of all cyclic vertex-cuts of G.In this paper

we prove that κc(C3□Cn1□Cn2□···□Cnk)=6 k and κc(Cn1□Cn2□···Cnk)=8 k-8

where Cni is a cycle with ni≥4 for i=1

···

关键词

Keywords

references

Cheng E,Liptak L,Qiu K,et al.Cyclic vertex-connectivity of Cayley graphs generated by transposition trees[J].Graphs and Combinatorics,2013,29:835-841.

Yu Z H,Liu Q H,Zhang Z.Cyclic vertex connectivity of star graphs[C].Hutchison,D Lecture Notes in Computer Science.Heidelberg:Springer,2010,212-221.

Chen L H,Meng J X,Tian Y Z.Cyclic vertex-connectivity of Cartesian product graphs[J].Chinese Annals of Mathematics,Series A,2016,37(2):155-170.

Huang D,Zhang Z.On cyclic vertex-connectivity of Cartesian product digraphs[J].Journal of Combinatorial Optimization,2012,24:379-388.

Liang J,Lou D J,Zhang Z B.A polynomial time algorithm for cyclic vertex connectivity of cubic graphs[J].International Journal of Computer Mathematics,2016,14pages,doi:10.1080/00207160.2016.1210792.

Xu J M.Topological Structure and Analysis of Interconnection Networks[M].London,Boston,Dordrecht:Kluwer Academic Publishers,2001.

Chiue W S,Shieh B S.On connectivity of the Cartesian product of two graphs[J].Applied Mathematics and Computation,1999,102:129-137.

S pacapan S.Connectivity of Cartesian product of graphs[J].Applied Mathematics Letters,2008,21:682-685.

Shieh B S.Super edge-and point-connectivities of the Cartesian product of regular graphs[J].Networks,2002,40:91-96.

Lu M,Wu C,Chen G L,et al.On super connectivity of Cartesian product graphs[J].Networks,2008,52:78-87.

Tian Y Z,Meng J X.Restricted connectivity for some interconnection networks[J].Graphs and Combinatorics,2015,31:1727-1737.

Xu J M,Yang C.Connectivity of Cartesian product graphs[J].Discrete Mathematics,2006,306:159-165.

Xu J M.Theory and Application of Graphs[M].London,Boston,Dordrecht:Kluwer Academic Publishers,2003.

浏览量

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

全图的圈连通度(英文)

一些运算图的Wiener极性指数(英文)

无限图的笛卡尔积的哈密顿性和连通性