期刊文献+

关于交叉立方体中一类保维自同构群的讨论

A Kind of Dimension Preserving Automorphism Group of the Crossed Cube
下载PDF
导出
摘要 交叉立方体的圈、路嵌入与容错问题是研究的热点.为进一步研究交叉立方体,本文构造了一类保维自同构并证明了在合成运算下这些保维自同构构成群. The embedding of paths or cycles in the crossed cube has been attracting much research inter- est, and the fault-tolerance of the crossed cube has been a major concern of relevant studies as well. In order to study the crossed cube further, it constructs a kind of dimension preserving automorphism, and proves that it can be a group with synthetic operation.
出处 《广东工业大学学报》 CAS 2013年第3期95-100,共6页 Journal of Guangdong University of Technology
关键词 交叉立方体 超立方体 互联网络 保维自同构 保维自同构群 crossed cube Hypercube interconnection networks dimension preserving automorphism dimension preserving automorphism group
  • 相关文献

参考文献15

  • 1Efe K. A variation on the Hypercube with lower diameter [ J]. IEEE Transactions on Parallel and Distributed Sys- tems, 1991,40( 11 ) : 1312-1316.
  • 2Efe K. The crossed cube architecture for parallel computa- tion [ J ]. IEEE Transactions on Parallel and Distributed Systems, 1992,3 ( 5 ) : 513-524.
  • 3Kulasinghe P, Bettayeb S. Embedding binary trees into crossed cubes [ J ]. IEEE Transactions on Computers, 1995,44(7 ) :923-929.
  • 4Baolei C, Fan J, Jiwen Y, et al. An algorithm to construct in- dependent spanning trees on crossed cubes [ EB/OL ]. (2010-10-04). http: // ieeexplore, ieee. org/search/ searchresuh, jsp? Newsearch = true&queryText - An + al- gorithm + to + construct + independent + sapnning + trees + on + crossed + cubes&x = 39&y = 17.
  • 5Yang M C, Li T K, Tan J J M, et al. Fault-tolerant cycle- embedding of crossed cube[J]. Information Processing let- ters 2003,88(4) : 149-154.
  • 6Fan J, Jian X, Lin X. Node-pancyclicity and edge-pancyc- licity of crossed cubes [ J ]. Information Processing letters, 2005,93(3) :133-138.
  • 7Dong Q, Yan X. Embedding a long fault-free cycle in a crossed cube with more faulty nodes [ J ]. Information Pro- cessing letters ,2010,110( 11 ) :464-468.
  • 8Li L, Guo D. Cycle embedding in crossed cubes with condi-tional edge faults [ EB/OL ]. ( 2012- 03- 23 ). http : ff ieeex- plore, ieee. org/xpl/articleDetails, jsp? tp = &amumb er = 6221716 &contentType = Conference + Publications &searchField% 3DSeareh_All% 26queryText% 3DE robed- ding + in + crossed + cubes + with + conditional + edge + faults.
  • 9李林,郭大昌,殷超杰.一类交叉立方体的自同构[J].广东工业大学学报,2011,28(4):45-47. 被引量:1
  • 10Wang D. On embedding Hamihonian cycles in crossed cubes[ J]. IEEE Transactions on Parallel and Distributed Systems 2008,19 ( 3 ) : 334-346.

二级参考文献9

  • 1Efe K. A variation on the hypercube with lower diameter [ J ]. IEEE Transactions on Computers, Parallel and Distributed Systems ,1991,40( 11 ) :1312-1316.
  • 2Fan J, Jia X, Lin X. Node-pancyclicity and edge-pancyclicity of crossed cubes [ J ]. Information Processing Letters, 2005,93 (3) : 133-138.
  • 3Kulasinghe P, Bettayeb S. Embedding binary trees into crossed cubes [ J ]. IEEE Transactions on Computers, 1995,44(7) :923-929.
  • 4Yang M C, Li T K. Fault-tolerant cycle-embedding of crossed cubes [ J ]. Information Processing Letters, 2003, 88(4) :149-154.
  • 5Hung H, Fu J, Chen G. Fault-free Hamihonian cycles in crossed cubes with conditional link faults [ J ]. Information Science, 2007,177 (24) :5664-5674.
  • 6Dong Q, Yang X. Embedding a long fault-free cycle in a crossed cube with more faulty nodes [ J ]. Information Processing Letters, 2010,110 ( 11 ) :464-468.
  • 7BaoIei C, Fan J, Jiwcn Y, et al. An algorithm to construct independent spanning trees on crossed cubes [ EB/OL ]. [ 2011- 06- 20 ]. http: // ieeexplore, ieee. org/search/ searchresuh, jsp? newsearch = true&queryText = An + algorithm + to + construct + independent + spanning + trees + on + crossed + cubes&x =39&y = 17.
  • 8Efe K. The crossed cube architecture for parallel computation[ J ]. IEEE Transactions on Computers, Parallel and Distributed Systems, 1992,3 (5) :513-524.
  • 9Efe K. Topological properties of the crossed cube archiecture[ J]. Parallel Computing, 1994,20(12) : 1763-1775.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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