位置：成果数据库 > 期刊 > 期刊详情页
含故障点的加强超立方体中路和圈的嵌入
  • ISSN号：0255-7797
  • 期刊名称：《数学杂志》
  • 时间：0
  • 分类：O157.6[理学—数学;理学—基础数学]
  • 作者机构：[1]华中师范大学数学与统计学院,湖北武汉430079, [2]三峡大学理学院,湖北宜昌443002
  • 相关基金：Supported by National Natural Science Foundation of China（11371162;11171129）; NSF of Hubei Province（T201103）.
作者： 刘敏[1], 刘红美[2]
关键词： 加强超立方体, 路嵌入, 圈嵌入, 容错性, enhanced hypercube, paths embedding, cycles embedding, fault-tolerantance
中文摘要：

本文研究了含故障点的n-维加强超立方体Qn,k中的路和圈嵌入的问题.充分分析了加强超立方体网络的潜在特性,利用了构造的方法.得到了含2n-4个故障点的加强超立方体Qn,k中含长为2^n-2f的容错圈的结论,推广了折叠超立方体网络中1-点容错圈嵌入的结果.其中折叠超立方体网络为加强超立方体网络的一种特殊情况.

英文摘要：

In this paper,the properties related to paths and cycles embedding in ndimensional enhanced hypercube Qn,k with fault vertices are investigated.To fully realize its potential in those networks,we use the construction way to prove our results and demonstrate that Qn,k with 2n-4 fault vertices can contain a cycle of length 2^n-2f,which generalizes the conclusion about 1-vertex fault-tolerant cycles embedding on folded hypercube networks,which is a special case of enhanced hypercube networks.

同期刊论文项目
群连通度和子图存在性及相关问题的研究
期刊论文 42
图中参数与子图存在性问题研究
期刊论文 3
同项目期刊论文
Nowhere-zero 3-flows and $Z_3$-connectivity in bipartite graphs
Group connectivity in 3-edge-connected graphs
Degree condition and $Z_3$-connectivity
The L(2,1)-labelling problem for cubic Cayley graphs on dihedral groups
Group Connectivity of Bridged Graphs
Labeling outerplanar graphs with maximum degree three
A relaxation of the Bordeaux Conjecture
Maximum Degree Condition and Group Connectivity
Group connectivity of semistrong product of graphs
Degree sum of 3 independent vertices and Z(3)-connectivity
Spanning Eulerian Subgraphs of 2-Edge-Connected Graphs
Induced hourglass and the equivalence between hamiltonicity and supereulerianity in claw-free graphs
Hamiltonian claw-free graphs with locally disconnected vertices
Realizing degree sequences as Z(3)-connected graphs
Nowhere-zero 3-flows of claw-free graphs
A note on Z(5)-connectivity in 3-edge-connected graphs
The Chvatal-Erdos Condition for Group Connectivity in Graphs
Nowhere-zero 3-flows in semistrong product of graphs
Z(3)-Connectivity of Wreath Product of Graphs
Collapsible graphs and Hamilton cycles of line graphs
Z3-connectivity with independent number 2
Nowhere-zero 3-flows in graphs admitting solvable arc-transitive groups of automorphisms
Strong chromatic index of subcubic planar multigraphs
Nowhere-zero 3-flows in Cayley graphs on generalized dihedral group and generalized quaternion group
Nowhere-zero 3-flows and $Z_3$-connectivity
Group chromatic number of Halin graphs
Z3-connectivity of K(1, 3)-free graphs without induced cycle of length at least 5
Group connectivity and matchings
Planar graphs without 5-cycles and intersecting triangles are (1, 1, 0)-colorable
On hamiltonicity of 2-connected claw-free graphs
故障折叠超立方体中的路和圈(英文)
（a,b,Ck）-临界图的一个最小度条件
关于哈密尔顿指数的综述
故障加强超立方体中的路和圈
加强超立方体中条件容错圈
故障加强超立方体中的路和圈
加强超立方体中条件容错圈
期刊信息
  • 《数学杂志》
  • 北大核心期刊（2011版）
  • 主管单位:中华人民共和国教育部
  • 主办单位:武汉大学 湖北省数学学会 武汉数学学会
  • 主编：陈化
  • 地址：湖北武汉大学
  • 邮编：430072
  • 邮箱：jmath@whu.edu.cn
  • 电话：027-68754687
  • 国际标准刊号：ISSN：0255-7797
  • 国内统一刊号：ISSN：42-1163/O1
  • 邮发代号:38-71
  • 获奖情况:
  • 国内外数据库收录:
  • 俄罗斯文摘杂志,美国数学评论（网络版）,德国数学文摘,日本日本科学技术振兴机构数据库,中国中国科技核心期刊,中国北大核心期刊（2004版）,中国北大核心期刊（2008版）,中国北大核心期刊（2011版）,中国北大核心期刊（2014版）,中国北大核心期刊（2000版）
  • 被引量:3910