Mutually Independent Hamiltonian Cycles in Dual-CubeExtensive Networks
碩士 === 中原大學 === 應用數學研究所 === 96 === Dual-cubes (DC_n's), introduced by Li and Peng in 2000 [14], are shown to be superior to hypercubes (Qn's) in many aspects. For example, it is proved that even though DCn and Q_2n+1 have the number of vertices and their diameters are almost the same,DC_n...
Main Authors: | Hui-Chun Chuang, 莊惠鈞 |
---|---|
Other Authors: | Shin-Shin Kao |
Format: | Others |
Language: | en_US |
Published: |
2008
|
Online Access: | http://ndltd.ncl.edu.tw/handle/76150701386814119526 |
Similar Items
-
Mutually Independent Hamiltonian Cycles in k-ary n-cubes when k is odd
by: Pi-Hsiang Wang, et al.
Published: (2009) -
Mutually Independent Hamiltonian Cycles in k-ary n-cubes when k is even
by: Jing-Ling Pan, et al.
Published: (2011) -
The mutually independent hamiltonian cycles of graphs
by: Da-Chung Yu, et al.
Published: (2011) -
Mutually Independent Hamiltonian Cycles on Some Graphs in Interconnection Networks
by: Hsun Su, et al.
Published: (2011) -
Mutually Independent Hamiltonian Cycles on Arrangement Graphs
by: Cheng-Da Lin, et al.
Published: (2011)