立方体的线图的限制性连通度(英文)

林辉球; 孟吉翔; 田应智

您当前的位置：

首页 >

文章列表页 >

立方体的线图的限制性连通度(英文)

更新时间：2026-01-21

- 立方体的线图的限制性连通度(英文)
- Journal of Xinjiang University (Natural Science Edition in Chinese and English) Vol. 27, Issue 1, Pages: 23-26(2010)
- 作者机构：
  
  新疆大学数学与系统科学学院
- 作者简介：
- 基金信息：
- DOI：
  CLC： O157.5
- Published：2010
- 稿件说明：
移动端阅览
[1]林辉球,孟吉翔,田应智.立方体的线图的限制性连通度(英文)[J].新疆大学学报(自然科学版),2010,27(01):23-26.

林辉球, 孟吉翔, 田应智. 立方体的线图的限制性连通度(英文)[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 2010, 27(1): 23-26.
[1]林辉球,孟吉翔,田应智.立方体的线图的限制性连通度(英文)[J].新疆大学学报(自然科学版),2010,27(01):23-26. DOI：

林辉球, 孟吉翔, 田应智. 立方体的线图的限制性连通度(英文)[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 2010, 27(1): 23-26. DOI：

摘要

子集SE(G)称为是图G的4-限制性边割

如果G-S不连通且每个连通分支至少有4个点.图G中基数最小的4-限制性边割称为4-限制性边连通度

记为λ4(G).本文确定了λ4(Qn)=4n-8.类似的

子集FV(G)称为图G的Rg-限制性点割

如果G-F不连通且每个连通分支的最小度不小于g.基数最小的Rg-限制性点割称为图G的Rg-限制性点连通度

记为κg(G).本文确定了κ1(L(Qn))=3n-4

κ2(L(Qn))=4n-8

其中L(Qn)是立方体的线图.

Abstract

A subset SE(G) is called a 4-restricted-edge-cut of G

if G-S is disconnected and every component contains at least 4 vertices.The minimum cardinality over all 4-restricted-edge-cut of G is calledthe 4-restricted-edge connectivity of G

denoted by λ4(G).In this paper

we prove that λ4(Qn) = 4n-8.Similarly

a subset FV(G) is called a Rg-vertex cut of G

if GF is disconnected and each vertex u ∈V(G)-F has at least g neighbors in G-F.The minimum cardinality of all Rg-vertex-cut is called the Rg-vertex connectivity of G

denoted by κg(G).In this paper

we prove that κ1(L(Qn)) = 3n-4

κ2(L(Qn))=4n-8

where L(Qn) is the line graph of Qn.

关键词

Keywords

references

Harary F.Conditional connectivity[J].Networks,1983,26:347-357.

Esfahanian A N.Generalized measures of fault tolerance with application to n-cube networks[J].IEEE Trans.Comput,1989,38(11):1586-1591.

Zhu Q,Xu J M.On the restricted edge connectivity and extra edge connectivity of hypercubes and folded-hypercubes[J].Journal of Univercity of Siciece and Techology of China,2006,36(3):249-253.

Yang W H,Meng J X.Extraconnectivity of Hypercubes[J].Applied mathmatics Letters,2009,22:887-891.

Latifi S,Hegde M,Naraghi-Pour M.Conditional connectivity Measures for Large Multiprocessor Systems[J].IEEE TransComput,2002,43(2):218-222.

Hellwig A,Rautenbach D,Volkmann L.Note on the connectivity of line graphs[J].Inform Process Lett,2004,91(1):7-10.

Meng J X.Superconnectivity and super edge-connectivity of line graphs[J].Graph Theory Notes of New York,2001,XL,12-14.

Bondy J A,Murty U S R.Graph theory with application[M].London:Macmillan,1976.

Xu J M,Lu Min,Meijie Ma and Angelika Hellwig.Super connectivity of line graph[J].Information Processing Letters,2005,94:191-195.

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

P₄-free图的控制团及应用(英文)

线图的邻域连通度(英文)

路图P₃(G)的色数(英文)

Related Author

薛妮妮

赵雪冰

张昭

孔祥艳

Related Institution

No data

⁰