由对换树生成的凯莱图的3-额外连通度(英文)

李恒哲; 孟吉翔; 杨卫华

您当前的位置：

首页 >

文章列表页 >

由对换树生成的凯莱图的3-额外连通度(英文)

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

- 由对换树生成的凯莱图的3-额外连通度(英文)
- 由对换树生成的凯莱图的3-额外连通度(英文)
- 新疆大学学报（自然科学版中英文） 2011年28卷第2期页码：148-151
- 作者机构：
  
  1. 新疆大学数学与系统科学学院
  2. 厦门大学数学与系统科学学院
- 作者简介：
- 基金信息：
  
  supported by NSFC(No.10671165)
- DOI：
  中图分类号： O157.5
- 纸质出版：2011
- 稿件说明：
移动端阅览
[1]李恒哲,孟吉翔,杨卫华.由对换树生成的凯莱图的3-额外连通度(英文)[J].新疆大学学报(自然科学版),2011,28(02):148-151+200.

李恒哲, 孟吉翔, 杨卫华. 由对换树生成的凯莱图的3-额外连通度(英文)[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 2011, 28(2): 148-151.
[1]李恒哲,孟吉翔,杨卫华.由对换树生成的凯莱图的3-额外连通度(英文)[J].新疆大学学报(自然科学版),2011,28(02):148-151+200. DOI：

李恒哲, 孟吉翔, 杨卫华. 由对换树生成的凯莱图的3-额外连通度(英文)[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 2011, 28(2): 148-151. DOI：

摘要

给定一个图G和一个非负整数g

若图G中存在(边)点集

使得删除该集合后图G不连通并且每个连通分支的点数大于g

所有这样的(边)点集的最小基数

称为g-额外(边)连通度(记作κg(G)(λg(G)).本文将确定由对换树生成的凯莱图的3-额外(边)连通度(记作κ3(λ3).

Abstract

Given a graph G and a non-negative integer g

the g-extra(edge) connectivity of G (written κg(G)(λg(G))is the minimum cardinality of a set of (edges)vertices of G

if any

whose deletion disconnects G

and every remaining component has more than g vertices. In this paper

we determine 3-extra(edge) connectivity(written κ3(λ3)) of Cayley graphs generated by transposition trees.

关键词

Keywords

references

Bondy J A,Murty U S R.Graph Theory with Applications[M].London:Macmillan press,1976.

Haray F.Conditional connectivity[J].Networks,1983,13:346-357.

Fàbrega J,Fiol M A.On the extraconnectivity of graghs[J].Discrete Mathematics,1996,155:49-57.

Godsil C,Royle G.Algebraic graph theory[M].Berlin:Springer press,2004.

Cheng E,Lipt`ak L,Shawash N.Orienting Cayley graphs generated by transposition trees[J].Computer&mathematicswith applications,2008,55:2662-2672.

Cheng E,Lipman M,Lipt`ak L.Strong structural properties of unidirectional star graphs[J].Discrete Applied Mathematics,2008,5:1-11.

Cheng E,Lipt`ak L.Linearly many faults in Cayley graphs generated by transposition trees[J].Information Sciences,2007,177:4877-4882.

Meng J,Ji Y.On a king of restricted edge connectivity of graphs[J].Discrete Apple Math,2002,177:183-193.

Wan M,Zhang Z.A kind of conditional vertex connectivity of a star graphs[J].Applied Mathematics Letters,2008,doi:10,1016/j.aml.2008.03.021.

Yang W,Meng J.Conditional connectivity of Cayley graphs generated by transposition trees[J].Received by Aplliedmathematics and computation.

Boesch F.Synthesis of networks――a survey[J],IEEE Trans.Reliability 1986,35:240-246.

Boesch F,Tindell R.Circulant and their connectivities[J].Graph Theory,1984,8:487-499.

Xu J M.Super connectivity of line graph[J].Information Processing Letters,2005,94:191-195.

浏览量

110

下载量

CSCD

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

提交

工具集

关联资源

完全对换网络的嵌入连通度