期刊文献+

交叉立方体连通圈网络的Hamilton分解 被引量:9

The Hamiltonian Decomposition of the Crossed Hypercube Connected Cycles Network
下载PDF
导出
摘要 交叉立方体连通圈网络CQCC(n)(n≥3)是一类典型的互连网络,它是3正则的.在2010年,师海忠提出如下猜想:CQCC(n)(n≥3)是Hamilton可分解的.也就是说,交叉立方体连通圈网络CQCC(n)(n≥3)可分解为边不交的一个Hamilton圈和一个完美对集的并.在这篇文章中,证明了当n=3;4;5;6时猜想成立,即交叉立方体连通圈网络CQCC(n)(n=3;4;5;6)可分解为边不交的一个Hamilton圈和一个完美对集的并。 The crossed hypercube connected cycles network CQCC (n) (n ≥ 3) is a classic interconnection network. It is 3 regular. In 2010, Shi Hai-zhong proposed a conjecture: CQCC (n) (n ≥ 3) was hamiltonian decomposition. That is to say, the crossed hypercube connected cycles network CQCC (n) (n ≥ 3) can be decomposed into union of edge-disjoint a Hamiltonian cycle and a perfect matching. In this paper, the author proves the conjecture is true when n= 3; 4; 5; 6. Namely, the crossed hypercube connected cycles network CQCC (n) (n = 3; 4; 5; 6) can be decomposed into union of edge-disjoint a Hamiltonian cycle and a perfect matching.
作者 张欣 师海忠
出处 《软件》 2015年第8期92-98,共7页 Software
关键词 互连网络 交叉立方体连通圈网络 HAMILTON圈 完美对集 Interconnection network Crossed hypercube connected cycles network Hamiltonian cycle Perfect matching
  • 相关文献

参考文献10

  • 1S Lakshmivarahan,Jung-Sing Jwo,S.K Dhall.Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey. Parallel Computing . 1993
  • 2S. B. Akers,B. Krishnamurthy.A Group-Theoretic Model for Symmetric Interconnection Networks. IEEE Transactions on Computers . 1989
  • 3Latifi S,Azevedo M,Bagherzadeh N.The star connected cycles:A fixed-degree network for parallel processing. InternationalConference on Parallel Processing(ICPP1993) . 1993
  • 4Bondy J A,,Mutry U S R.Graph Theory. Journal of Women s Health . 2008
  • 5M.S.Krishnamoorthy,B.Krishnamoorthy.Faulty tolerance of star graph. Proc.2nd Internet.Conf.on Supercomputing . 1987
  • 6M.M.de Azevedo,N.Bagherzadeh,S.Lati_.Fault-dameter of the Star-connected cycles inter-connection network. Proceeding of the Annual Hawaii International Conference on System Sciences . 1995
  • 7S.R.hring,F.Sarkar,D.H.H.ohndel.Cayley graph connected cycles:A new class of_xed-degree Interconnection network. Proceeding of the Annual Hawaii International Conference on System Sci-ences . 1995
  • 8Hai-zhong Shi,Yue Shi.Cell-breeding graph model for interconnection networks. http://vdisk.weibo.com/s/dliz Jyfesb05y .
  • 9Hai-zhong Shi,Pan-feng Niu.Hamiltonian deconposition of some intercoonection networks. Ding-zhu Du.Proceed of the 3th Aunnal International Conference on Combinatorial Optimization and Applications . 2009
  • 10Hai-zhong Shi,Yue Shi.A Variety of Conjectures on Cayley Graphs Generated by Connected Graphs. http://vdisk.weibo.com/s/dliz Jyfe Bx7Lh .

共引文献3

同被引文献25

  • 1马美杰,徐俊明.交叉超立方体网络的边泛圈性(英文)[J].中国科学技术大学学报,2005,35(3):329-333. 被引量:8
  • 2Hai-zhong Shi,Pan-feng Niu,Jian-bo Lu.??One conjecture of bubble-sort graphs(J)Information Processing Letters . 2011 (18)
  • 3S. B. Akers,B. Krishnamurthy.A Group-Theoretic Model for Symmetric Interconnection Networks. IEEE Transactions on Computers . 1989
  • 4Haizhong Shi,Yue Shi.A new model for interconnection ne twork:k-hierarchical ring and r-layer graph network. http://v disk.weibo.com/s/dliz Jyfer Z-Zl .
  • 5S.R. (O|¨)hring,F.Sarkar,D.H.Hohndel.Cayley graph connected cycles:A new class of fixed-degree Interconnection networks. Proceeding of the 28th annual Hawaii international conference on system science . 1995
  • 6Jovanovi, Zoran,Misic, Jelena.Fault tolerance of the star graph interconnection network. Information Processing Letters . 1994
  • 7Latifi S.Combinatorial analysis of the fault diameter of the n-cube. IEEE Transactions on Computers . 1993
  • 8Haizhong Shi,Yue Shi.A hierarchical Ring Group-Theoretic Model for Interconnection Networks. http://vdisk.weibo.com/s/dliz Jyfe BX-2J .
  • 9N.Biggs.Algebraic Graph theory. . 1993
  • 10师海忠,路建波.关于互连网络的几个猜想[J].计算机工程与应用,2008,44(31):112-115. 被引量:20

引证文献9

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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