The Study for Ring Embedding in Faulty Generalized Pancake Networks

碩士 === 大葉大學 === 資訊工程學系碩士班 === 92 === In this thesis, we study the fault-tolerant properties for n-dimensional 2-sided pancake graphs (2Pn). We obtain that when |F| <= (n - 2), 2Pn - F are Hamiltonian graphs, and when |F| <= (n - 3), 2Pn - F are Hamiltonian connected graphs with n &g...

Full description

Bibliographic Details
Main Authors: Ying-Zhi Lai, 賴盈志
Other Authors: C. N. Hung
Format: Others
Language:zh-TW
Published: 2004
Online Access:http://ndltd.ncl.edu.tw/handle/11575699179316640817
id ndltd-TW-092DYU00392006
record_format oai_dc
spelling ndltd-TW-092DYU003920062016-01-04T04:08:55Z http://ndltd.ncl.edu.tw/handle/11575699179316640817 The Study for Ring Embedding in Faulty Generalized Pancake Networks 一般化煎餅網路之環狀容錯研究 Ying-Zhi Lai 賴盈志 碩士 大葉大學 資訊工程學系碩士班 92 In this thesis, we study the fault-tolerant properties for n-dimensional 2-sided pancake graphs (2Pn). We obtain that when |F| <= (n - 2), 2Pn - F are Hamiltonian graphs, and when |F| <= (n - 3), 2Pn - F are Hamiltonian connected graphs with n >= 3, F = (V(2Pn) and E(2Pn)). We also investigate the fault-tolerant properties for n-dimensional m-sided pancake graphs (mPn). Assume the graphs mP2 are 2-Hamiltonian and 1-Hamiltonian connected, when |F| <= (2n - 2), mPn - F are Hamiltonian graphs, and when |F| <= (2n - 3), mPn - F are Hamiltonian connected graphs with n >= 3, m >= 3, F = (V(mPn) and E(mPn)). C. N. Hung 洪春男 2004 學位論文 ; thesis 63 zh-TW
collection NDLTD
language zh-TW
format Others
sources NDLTD
description 碩士 === 大葉大學 === 資訊工程學系碩士班 === 92 === In this thesis, we study the fault-tolerant properties for n-dimensional 2-sided pancake graphs (2Pn). We obtain that when |F| <= (n - 2), 2Pn - F are Hamiltonian graphs, and when |F| <= (n - 3), 2Pn - F are Hamiltonian connected graphs with n >= 3, F = (V(2Pn) and E(2Pn)). We also investigate the fault-tolerant properties for n-dimensional m-sided pancake graphs (mPn). Assume the graphs mP2 are 2-Hamiltonian and 1-Hamiltonian connected, when |F| <= (2n - 2), mPn - F are Hamiltonian graphs, and when |F| <= (2n - 3), mPn - F are Hamiltonian connected graphs with n >= 3, m >= 3, F = (V(mPn) and E(mPn)).
author2 C. N. Hung
author_facet C. N. Hung
Ying-Zhi Lai
賴盈志
author Ying-Zhi Lai
賴盈志
spellingShingle Ying-Zhi Lai
賴盈志
The Study for Ring Embedding in Faulty Generalized Pancake Networks
author_sort Ying-Zhi Lai
title The Study for Ring Embedding in Faulty Generalized Pancake Networks
title_short The Study for Ring Embedding in Faulty Generalized Pancake Networks
title_full The Study for Ring Embedding in Faulty Generalized Pancake Networks
title_fullStr The Study for Ring Embedding in Faulty Generalized Pancake Networks
title_full_unstemmed The Study for Ring Embedding in Faulty Generalized Pancake Networks
title_sort study for ring embedding in faulty generalized pancake networks
publishDate 2004
url http://ndltd.ncl.edu.tw/handle/11575699179316640817
work_keys_str_mv AT yingzhilai thestudyforringembeddinginfaultygeneralizedpancakenetworks
AT làiyíngzhì thestudyforringembeddinginfaultygeneralizedpancakenetworks
AT yingzhilai yībānhuàjiānbǐngwǎnglùzhīhuánzhuàngróngcuòyánjiū
AT làiyíngzhì yībānhuàjiānbǐngwǎnglùzhīhuánzhuàngróngcuòyánjiū
AT yingzhilai studyforringembeddinginfaultygeneralizedpancakenetworks
AT làiyíngzhì studyforringembeddinginfaultygeneralizedpancakenetworks
_version_ 1718159478217506816