The Hamiltonian properties for faulty pancake graphs
碩士 === 大葉大學 === 資訊工程學系碩士班 === 91 === The use of pancake and star networks as an interconnection network has been studied by many researchers. The fault tolerance for Hamiltonian networks is also an important issue. In this thesis, we prove that an n-dimensional faulty pancake graph contai...
Main Author: | 梁高源 |
---|---|
Other Authors: | Chun-Nan Hung |
Format: | Others |
Language: | en_US |
Published: |
2003
|
Online Access: | http://ndltd.ncl.edu.tw/handle/96947064649611346038 |
Similar Items
-
The Embedding of Hamiltonian Paths in Faulty Arrangement Graphs
by: Ray-Shang Lo, et al.
Published: (2000) -
Fault-Tolerant Routing Algorithm in Pancake Graph with one Faulty Node on Genome Rearrangement
by: Chou, Yu-Sheng, et al.
Published: (2011) -
The Study for Ring Embedding in Faulty Generalized Pancake Networks
by: Ying-Zhi Lai, et al.
Published: (2004) -
Fault-Tolerant Routing Algorithm in Burnt Pancake Graph with one Faulty Node on Genome Rearrangement
by: Yu-Wei Wang, et al.
Published: (2011) -
A simple scheme of generating Faulty-tolerant bipartite graphs with Hamiltonian properties
by: Yu-Chih Chen, et al.
Published: (2003)