期刊文献+

容错变形超立方体的圈和路(英文) 被引量:1

Hamilton paths and cycles in fault-tolerant varietal hypercubes
下载PDF
导出
摘要 考虑包含故障边的n(n≥3)维变形超立方体VQn,证明了:如果故障边数不超过n-2,那么VQn包含非故障边的Hamilton圈;如果故障边数不超过n-3,那么对任何两个不同顶点x和y,VQn包含非故障边的xy-Hamilton路.该证明方法采用归纳法. The varietal hypercube VQn, a variant of the hypercube Qn, was studied. It was proved that VQn contains a fault-free Hamilton cycle provided faulty edges do not exceed n-2, and that for two distinct vertices, x and y, there is a fault-free xy-Hamilton path in VQ, provided faulty edges do not exceed n-3 for n≥3. The proof is based on an inductive construction.
出处 《中国科学技术大学学报》 CAS CSCD 北大核心 2015年第6期436-442,共7页 JUSTC
基金 Supported by NNSF of China(61272008)
关键词 图论 HAMILTON圈 HAMILTON路 变形超立方体 容错网络 graphs Hamilton path Hamilton cycle varietal hypercube fault-tolerant networks
  • 相关文献

参考文献3

二级参考文献20

  • 1HUANG Jia XU Jun-ming.Multiply-twisted Hypercube with Four or Less Dimensions is Vertex-transitive[J].Chinese Quarterly Journal of Mathematics,2005,20(4):430-434. 被引量:2
  • 2Xu Jun ming. Theory and Application of Graphs[M]. Dordrecht/Boston/London: Kluwer Academic Publishers, 2003.
  • 3Bauer D, Boesch F, Suffel C, et al. Connectivity extremal problems and the design of reliable probabilistic networks[C]//The Theory and Application of Graphs. New York: Wiley, 1981:89-98.
  • 4Esfahanian A H. Generalized measures of fault tolerance with application to n-cube networks [J]. IEEE Trans Comput, 1989,38(11) : 1 586-1 591.
  • 5Esfahanian A H, Hakimi S L. On computing a conditional edge-connectivity of a graph [J].Information Processing Letters, 1988, 27: 195- 199.
  • 6Balbuena C, Garcia-Vazquez R, Marcote X. Sufficient conditions for λ'-optimality in graphs with girth g[J].J Graph Theory, 2006, 52(1): 73 86.
  • 7Bonsma P, Ueffing N, Volkmann I: Edge-cuts leaving components of order at least three [J]. Discrete Mathematics, 2002, 256(1 -2):431-439.
  • 8Hellwig A, Volkmann L. Sufficient conditions for λ'- optimality in graphs of diameter 2 [J]. Discrete Mathematics, 2004, 283(1- 3): 113-120.
  • 9Lu Min, Chen Guo-liang, Xu Jun-ming. On super edge-connectivity of Cartesian product graphs[J]. Networks, 2007, 49(2): 135-157.
  • 10Meng J X. Optimally super-edge-connected transitive graphs[J]. Discrete Mathematics, 2003, 260 (1-3) : 239 -248.

共引文献2

同被引文献5

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部