Fault Hamiltonicity of Hierarchical Restricted HL-graphs
碩士 === 國立東華大學 === 資訊工程學系 === 98 === The hierarchical restricted HL-graph HRHL(k, n) is a new kind of interconnection network, such as the hierarchical crossed cube HCC(k, n). The hierarchical restricted HL-graph is constructed according to the hypercube and the restricted HL-graph. In this thesis, w...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/42084670475671932851 |
| Summary: | 碩士 === 國立東華大學 === 資訊工程學系 === 98 === The hierarchical restricted HL-graph HRHL(k, n) is a new kind of interconnection network, such as the hierarchical crossed cube HCC(k, n). The hierarchical restricted HL-graph is constructed according to the hypercube and the restricted HL-graph. In this thesis, we show that HRHL(k, n) is (k+n-2)-fault hamiltonian and (k+n-3)-fault hamiltonian connected for k >= 1 and n >= 3.
|
|---|