Bifanability of Bipartite Hypercube-like Networks
碩士 === 大葉大學 === 資訊工程學系碩士班 === 93 === In this thesis, we introduce the concepts of bifanability and fault tolerant bifanability. We show that the n-dimensional hypercube Qn and bipartite hypercube-like Xn are f edges fault tolerant k*-bifanable for n ≥ 3, 0 ≤ f ≤ n - 2, 1 ≤ k ≤ n - f. We also prove t...
Main Authors: | Chia-Cheng Chen, 陳嘉振 |
---|---|
Other Authors: | Chun-Nan Hung |
Format: | Others |
Language: | en_US |
Published: |
2005
|
Online Access: | http://ndltd.ncl.edu.tw/handle/48609461565753669275 |
Similar Items
-
The Study for Adjacent Vertices Fault-Tolerance Bifanability of Hypercube
by: Po-Tsun Lin, et al.
Published: (2010) -
The Study of Adjacent Vertices Fault-Tolerance Bifanability of Hypercube with the Same Color Sources
by: YAN,CHING-JAN, et al.
Published: (2010) -
Edge Fault-tolerant Hamiltonian Laceability of Bipartite Hypercube-like Networks
by: Ko-Chen Hu, et al.
Published: (2005) -
Graph Bipartition on Hypercube by Simulated Annealing
by: Chen, Wei-Yu, et al.
Published: (1993) -
An algorithm for generating generalized splines on graphs such as complete graphs, complete bipartite graphs and hypercubes
by: Radha Madhavi Duggaraju, et al.
Published: (2020-01-01)