位置：成果数据库 > 期刊 > 期刊详情页
变形超立方体网络的可靠性分析
  • ISSN号：0253-2778
  • 期刊名称：《中国科学技术大学学报》
  • 时间：0
  • 分类：O157.5[理学—数学;理学—基础数学] TP302.1[自动化与计算机技术—计算机系统结构;自动化与计算机技术—计算机科学与技术]
  • 作者机构：[1]中国科学技术大学数学系,安徽合肥230026
  • 相关基金：Foundation item：Supported by NNSF of China （10671191）.
作者： 王建伟[1], 徐俊明[1]
关键词： 连通度, 限制连通度, 超连通度, 变形超立方体, 网络, connectivity, restricted connectivity, super connectivity, varietal hypercube, networks
中文摘要：

作为超立方体网络的变形，n维变形超立方体VQn是Cheng和Chuang于1994年提出来的，它具有许多超立方体所具有的优良性质，比如正则性和递归结构．证明了：VQn的连通度和边连通度都等于扎，限制连通度和限制边连通度都等于2n-2．这个结果意味着，为了使VQ。不连通且不含孤立点，至少有2n-2个点或者边要同时发生故障．

英文摘要：

As a variations of the hypercube network, the n dimensional varietal hypercube VQn, proposed by Cheng and Chuang in 1994, has many desirable properties of the hypercube such as regularity and reeursive structure. It was shown that the connectivity and the edge-connectivity of VQn are both equal to n, the restricted connectivity and the restricted edge-connectivity are both equal to 2n- 2, which implies that at least 2n- 2 vertices of VQn are removed to get a disconnected graph without isolated vertices.

同期刊论文项目
网络中若干图论问题研究
期刊论文 80 获奖 2 著作 1
同项目期刊论文
纽立方体网络的容错泛圈性
超立方体网络的(d,k)控制数
循环图的转发指数(英文)
Feedback numbers of Kautz digraphs
The total domination and total bondage numbers of extended de Bruijn and Kautz digraphs
The bondage numbers of graphs with small crossing numbers
Fault diameter of product graphs
On super edge-connectivity of Cartesian product graphs
The forwarding indices of augmented cubes
Fault-tolerant pancyclicity of augmented cubes
A new upper bound on forwarding index of graphs
The restricted edge-connectivity of de Bruijn undirected graphs
On Distance Connected Domination Numbers of Graphs
Total domination of Cartesian products of graphs
星图S4的交叉数
关于局部扭立方体的反馈数
Survey on path and cycle embedding in some networks
Fault-tolerant panconnectivity of augmented cubes
Probabilistic analysis of upper bounds for 2-connected distance k-dominating sets in graphs
The Forwarding Indices of Wrapped Butterfly Networks
Reinforcement numbers of digraphs
A new class of transitive graphs
Bipanconnectivity of Cartesian product graphs
Feedback Numbers of De Bruijn Digraphs
Domination and Total Domination Contraction Numbers of Graphs
Super and Restricted Connectivity of Some Interconnection Networks
Connectivity and super- connectivity of Cartesian product graphs
Algebraic properties and Panconnectivity of Folded Hypercubes
A note on unimodular congruence of the Laplacian matrix of a graph
Panconnectivity of Cartesian Product Graphs
Connectivity of lexicographic product and direct product of graphs
Bounds on Feedback Numbers of de Bruijn Graphs
The critical group of $K_m\times C_n$
The critical group of $C_4\times C_m$
(n,2n)-dominating numbers of undirected toroidal mesh C(3,3,...,3)
3正则3连通图的转发指数(英文)
强乘积图的连通度和边连通度(英文)
容错超立方体网络的圈嵌入(英文)
Weakly Edge-Pancyclicity of Locally Twisted Cubes
Restricted edge-connectivity of de Bruijn digraphs
The super connectivity of augmented cubes
Distance domination-critical graphs
The bondage numbers and efficient dominations of vertex-transitive graphs
The critical group of Km × Pn
A characterization of (2 gamma, gamma(p))-trees
Paired Domination Vertex Critical Graphs
Fault-tolerant embedding of paths in crossed cubes
Reliability of Interconnection Networks Modeled by Cartesian Product Digraphs
Strongly total domination edge critical graphs
超环面图上的约束数(英文)
关于图的边添加(英文)
On the total {k}-domination number of Cartesian products of graphs
On the {k}-domination number of Cartesian products of graphs
A Note on Distance Domination Numbers of Graphs
Edge-fault-tolerant Bipanconnectivity of Hypercubes
Bounded edge-connectivity and edge-persistence of Cartesian product of graphs
A note on "The super connectivity of augmented cubes"
On super edge-connectivity of product graphs
On (a, d)-Antimagic Labelings of Generalized Petersen Graphs
A note on the p-domination number of trees
Reliability analysis of Varietal Hypercube Networks
Some graphs with minimum Hosoya Index and maximum Merrifield-Simmons
超立方体网络的边容错二部泛连通度
容错超立方体网络的圈嵌入
强全控制边临界图
强乘积图的连通度和边连通度
3正则3连通图的转发指数
超环面图上的约束数
关于图的边添加
Paired Domination of Cartesian Products of Graphs
Bipartite Graphs Kn,n＋r- A （ ｜A｜ 〈 3） Determined by Their Cycle LengthDistributions
（n, 2n）-Dominating Numbers of Undirected Toroidal Mesh C（3,3,...,3）
期刊信息
  • 《中国科学技术大学学报》
  • 北大核心期刊（2011版）
  • 主管单位:中国科学院
  • 主办单位:中国科学技术大学
  • 主编：何多慧
  • 地址：安徽省合肥市金寨路96号
  • 邮编：230026
  • 邮箱：JUST@USTC.EDU.CN
  • 电话：0551-63601961 63607694
  • 国际标准刊号：ISSN：0253-2778
  • 国内统一刊号：ISSN：34-1054/N
  • 邮发代号:26-31
  • 获奖情况:
  • 1999年，全国优秀高等学校自然科学学报及教育部优...,2001年，安徽省1999-2001年度优秀科技期刊一等奖,2002年，第三届华东地区优秀期刊奖
  • 国内外数据库收录:
  • 俄罗斯文摘杂志,美国化学文摘（网络版）,美国数学评论（网络版）,德国数学文摘,荷兰文摘与引文数据库,美国剑桥科学文摘,英国科学文摘数据库,日本日本科学技术振兴机构数据库,中国中国科技核心期刊,中国北大核心期刊（2004版）,中国北大核心期刊（2008版）,中国北大核心期刊（2011版）,中国北大核心期刊（2014版）,中国北大核心期刊（2000版）
  • 被引量:8237