Adjacent Vertices Fault Tolerance Hamiltonian Laceability of Star Graphs
碩士 === 大葉大學 === 資訊工程學系碩士班 === 94 === Let Sn be an n-dimensional Star graph. In this paper, we show that Sn −F is Hamiltonian laceable where F is the set of f ≤(n−4) pairs of adjacent faulty vertices, Sn−F is Hamiltonian where F is the set of f ≤(n−3) pairs of adjacent faulty vertices. We also show...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2006
|
Online Access: | http://ndltd.ncl.edu.tw/handle/20553242106529293033 |
id |
ndltd-TW-094DYU00392007 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-094DYU003920072015-10-13T10:34:49Z http://ndltd.ncl.edu.tw/handle/20553242106529293033 Adjacent Vertices Fault Tolerance Hamiltonian Laceability of Star Graphs 星狀網路的漢米爾頓可蕾絲相鄰點容錯之研究 Chun-Yen Yang 楊俊彥 碩士 大葉大學 資訊工程學系碩士班 94 Let Sn be an n-dimensional Star graph. In this paper, we show that Sn −F is Hamiltonian laceable where F is the set of f ≤(n−4) pairs of adjacent faulty vertices, Sn−F is Hamiltonian where F is the set of f ≤(n−3) pairs of adjacent faulty vertices. We also show that Sn −F is hyper-Hamiltonian laceable where F is the set of f ≤(n −4) pairs of adjacent faulty vertices. Applying these results, we also construct the fault-free cycle with length n! −2f + 2 in Sn −F’ where F’ is the faulty vertices set with at least a black vertex and a white vertex for |F’| = f ≤n−2 and the fault-free path with length n! −2f+ 1 for any two different color vertices in Sn−F’where F’is the faulty vertices set with at least a black vertex and a white vertex for |F`| = f ≤n−3 and n!−2f for any two same color vertices in Sn −F′where F′is the faulty vertices set for |F`| = f ≤n−3 Chun-Nan Hung 洪春男 2006 學位論文 ; thesis 32 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 大葉大學 === 資訊工程學系碩士班 === 94 === Let Sn be an n-dimensional Star graph. In this paper, we show that Sn −F is Hamiltonian laceable where F is the set of f ≤(n−4) pairs of adjacent faulty vertices, Sn−F is Hamiltonian where F is the set of f ≤(n−3) pairs of adjacent faulty vertices. We also show that Sn −F is hyper-Hamiltonian laceable where F is the set of f ≤(n −4) pairs of adjacent faulty vertices. Applying these results, we also construct the fault-free cycle with length n! −2f + 2 in Sn −F’ where F’ is the faulty vertices set with at least a black vertex and a white vertex for |F’| = f ≤n−2 and the fault-free path with length n! −2f+ 1 for any two different color vertices in Sn−F’where F’is the faulty vertices set with at least a black vertex and a white vertex for |F`| = f ≤n−3 and n!−2f for any two same color vertices in Sn −F′where F′is the faulty vertices set for |F`| = f ≤n−3
|
author2 |
Chun-Nan Hung |
author_facet |
Chun-Nan Hung Chun-Yen Yang 楊俊彥 |
author |
Chun-Yen Yang 楊俊彥 |
spellingShingle |
Chun-Yen Yang 楊俊彥 Adjacent Vertices Fault Tolerance Hamiltonian Laceability of Star Graphs |
author_sort |
Chun-Yen Yang |
title |
Adjacent Vertices Fault Tolerance Hamiltonian Laceability of Star Graphs |
title_short |
Adjacent Vertices Fault Tolerance Hamiltonian Laceability of Star Graphs |
title_full |
Adjacent Vertices Fault Tolerance Hamiltonian Laceability of Star Graphs |
title_fullStr |
Adjacent Vertices Fault Tolerance Hamiltonian Laceability of Star Graphs |
title_full_unstemmed |
Adjacent Vertices Fault Tolerance Hamiltonian Laceability of Star Graphs |
title_sort |
adjacent vertices fault tolerance hamiltonian laceability of star graphs |
publishDate |
2006 |
url |
http://ndltd.ncl.edu.tw/handle/20553242106529293033 |
work_keys_str_mv |
AT chunyenyang adjacentverticesfaulttolerancehamiltonianlaceabilityofstargraphs AT yángjùnyàn adjacentverticesfaulttolerancehamiltonianlaceabilityofstargraphs AT chunyenyang xīngzhuàngwǎnglùdehànmǐěrdùnkělěisīxiānglíndiǎnróngcuòzhīyánjiū AT yángjùnyàn xīngzhuàngwǎnglùdehànmǐěrdùnkělěisīxiānglíndiǎnróngcuòzhīyánjiū |
_version_ |
1716830637113999360 |