交换折叠交叉立方体的Hamilton分解及其性质
The Hamiltonian Decomposition and Its Properties of Exchanged Folded Crossed Cube
摘要:
交换折叠交叉立方体(EFCQ(s,t))是一种用于并行计算的新型互连网络。在这篇文章中，作者证明了s=t=1;2 时，EFCQ(s,t)是Hamilton可分解的；s=t=1;2;3时，EFCQ(s,t)可以分解为一个Hamilton圈和s个完美对集。最后对EFCQ(s,t)的一些性质进行了证明。
Abstract:
Exchanged folded crossed cube (EFCQ(s,t)) is a new interconnection network for parallel computation. In this article, author proved EFCQ(s,t) is Hamiltonian decomposition, when s=t=1;2. And EFCQ(s,t) can be decomposed into a Hamiltonian cycle and s perfect matching, when s=t=1;2;3. Finally, some properties of EFCQ(s,t) are proved.
参考文献
|
[1]
|
Nibedita, A. and Tripathy, C.R. (2010) The Folded Crossed Cube: A New Interconnection Network for Parallel Systems. International Journal of Computer Applications, 4, 43-40.
|
|
[2]
|
Lon, P.K.K., Hsu, W.J. and Pan, Y. (2005) The Ex-changed Hypercube. IEEE Transaction on Parallel and Distributed Systems, 16, 866-874. [Google Scholar] [CrossRef]
|
|
[3]
|
Li, K., Mu, Y., Li, K. and Min, G. (2013) Exchanged Crossed Cube: A Novel Interconnection Network for Parallel Computation. IEEE Transaction on Parallel and Distributed Systems, 24, 2211-2219. [Google Scholar] [CrossRef]
|
|
[4]
|
徐俊明. 组合网络理论[M]. 北京: 科学出版社, 2007.
|
|
[5]
|
Bondy, J.A. and Murty, U.S.R. (1976) Graph Theory with Applications. Macmillan Press Ltd., London and Basingstoke.
|
|
[6]
|
师海忠. 正则图连通圈: 多种互连网络的统一模型[C]//中国运筹学会第十届学术交流会论文集, 2010: 202-208.
|
|
[7]
|
Bhavani, K. and Jena, S. (2018) Exchanged Folded Crossed Cube: A New Interconnection Network for Parallel Computation. Information Processing Letters, 137, 40-46. [Google Scholar] [CrossRef]
|
|
[8]
|
蔡学鹏, 杨伟, 杜洁, 任佰通. 交换折叠交叉立方体的连通度和超连通度[J]. 吉首大学学报, 2019, 40(5): 1-9.
|
|
[9]
|
周东仿. 交换交叉立方体上若干性质的研究[D]: [博士学位论文]. 苏州: 苏州大学, 2017.
|