超立方体外边连通度可靠性分析(英文)

张明祖; 孟吉翔; 田应智

您当前的位置：

首页 >

文章列表页 >

超立方体外边连通度可靠性分析(英文)

研究精粹 | 更新时间：2026-01-21

- 超立方体外边连通度可靠性分析(英文)
- 超立方体外边连通度可靠性分析(英文)
- 新疆大学学报（自然科学版中英文） 2013年30卷第3期页码：253-256
- 作者机构：
  
  新疆大学数学与系统科学学院
- 作者简介：
- 基金信息：
  
  supported by NSFC(11171283)
- DOI：
  中图分类号： O157.5
- 纸质出版：2013
- 稿件说明：
移动端阅览
[1]张明祖,孟吉翔,田应智.超立方体外边连通度可靠性分析(英文)[J].新疆大学学报(自然科学版),2013,30(03):253-256+268.

张明祖, 孟吉翔, 田应智. 超立方体外边连通度可靠性分析(英文)[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 2013, 30(3): 253-256.
[1]张明祖,孟吉翔,田应智.超立方体外边连通度可靠性分析(英文)[J].新疆大学学报(自然科学版),2013,30(03):253-256+268. DOI：

张明祖, 孟吉翔, 田应智. 超立方体外边连通度可靠性分析(英文)[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 2013, 30(3): 253-256. DOI：

摘要

可靠性评估对于多处理系统的设计和维护占据重要的地位.在众多的可靠性评价系统方法中

外边连通度(也称限制性边连通度)是其中重要的一种.对于一个正整数h

如果图G的边集合S

满足G S是不连通的

并且每一个连通分支至少有h个点

则称S是图G的h-外边割.称h-外边割S最小的基数为图G的h-外边连通度

记为λh(G).文章给出了n维超立方体Qn的h-外边连通度λh(Qn)

其中正整数n≥7

2n2+1≤h≤2n2+2.

Abstract

Reliability evaluation of systems is important to the design and maintenance of multiprocessor systems.The extra edge-connectivity( also restricted edge connectivity) is a kind of measure for the reliability of interconnection systems. For a given positive integer h

an edge set S of a connected graph G is called as a h-extra edge-cut

if G-S is no longer connected

and each component of G- S has at least h vertices. The cardinality of a minimum h-extra edge-cut

is the h-extra edge-connectivity of G

denoted by λh(G). Let n be a positive integer

n ≥ 7. In this paper

we determine the h-extra edge-connectivity of n-dimensional hypercube λh(Q n) for 2n2 +1≤ h ≤ 2n2 +2.

关键词

Keywords

references

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

Fabrega,Fiol M A.On the extraconnectivity of graphs[J].Discrete Math,1996,155:49-57.

Latifi S,Hegde M,Naraghi-Pour M.Conditional connectivity measures for large multiprocessor systems[J].IEEE Trans on Computers,2002,43:218-222.

Yang X,Cao J,Megson M,et al.Minimum neighborhood in a generalized cube[J].Information Processing Lett,2006,97:88-93.

Yang X,Evans D J,Chen B,et al.On the maximal connected component of hypercube with faulty vertices[J].Int J Comput Math,2004,81:515-525.

Yang X,Evans D J,Megson G M.On the maximal connected component of hypercube with faulty vertices II[J].Int J Comput Math,2004,81:1175-1185.

Yang X,Evans D J,Megson G M.On the maximal connected component of a hypercube with faulty vertices III[J].Int J Comput Math,2006,83:27-37.

Yang Weihua,Meng Jixiang.Extraconnectivity of Hypercubes[J].Applied Mathematics Lett,2009,22:887-891.

Yang Weihua,Meng Jixiang.Extraconnectivity of hypercubes II[J].Australasian Journal of Combinatorics,2010,47:189-195.

Yang Weihua,Meng Jixiang.Generalized measures of fault tolerance in hypercube networks[J].Applied Mathematics Lett,2012,25:1335-1339.

Esfahanian A H.Generalized Measure of Fault Tolerance with Application to n-cube Networks[J].IEEE Trans on Computer,1989,38:1586-1591.

Zhu Q,Xu J M.On restricted edge connectivity and extra edge connectivity of hypercubes and foled hypercubes[J].J University of Science and Technology of China,2006,36:246-253.

Zhu Q,Xu J M,Lu M.Edge fault tolerance analysis of a class of networks[J].Appl Math Comput,2006,172:111-121.

Hsieh S Y.Extra edge connectivity of hypercube-like networks[J].International Journal of Parallel Emergent and Distributed Systems,2013,28:123-133.

Li Hao,Yang weihua.Bounding the size of the subgraph induced by m vertices and extra edge-connectivity of hypercubes[J].Discrete Applied Mathematics,http://dx.doi.org/10.1016/j.dam.2013.04.009.

Lin H,Meng Jixiang.Restricted Connectivity of the Line Graph of Hypercube[J].J Xinjiang University,2010,27:23-26.

浏览量

下载量

CSCD

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

提交

工具集

关联资源

传递图中的限制性边连通度(英文)

对称群上Cayley图的连通性(英文)

超立方体的r-Hued染色（英文）

图的分支点连通度和分支边连通度综述（英文）