https://scholars.lib.ntu.edu.tw/handle/123456789/117049
標題: | Embed a Longest Path between Arbitrary Two Vertices of a Faulty Star Graph | 作者: | Hsieh, Sun-Yuan Chen, Gen-Huey Ho, Chin-Wen |
公開日期: | 一月-2000 | 出版社: | 臺北市:國立臺灣大學資訊工程學系 | 摘要: | The star graph Sn has been recognized as an attractive alternative to the hypercube. Since S1, S2, & S3 have trivial structures, we focus our attention on Sn with n≥4 in this paper. Let Fv denote the set of faulty vertices in Sn. We show that when |Fv|≤n−5, Sn with n≥6 can embed a fault−free path of length n!-2|Fv|−2 (n!-2|Fv|−1, respectively) between arbitrary two vertices of even (odd, respectively) distance. |
URI: | http://ntur.lib.ntu.edu.tw//handle/246246/20060927122911257271 | 其他識別: | 20060927122911257271 |
顯示於: | 資訊工程學系 |
檔案 | 描述 | 大小 | 格式 | |
---|---|---|---|---|
star-00-01.pdf | 154.47 kB | Adobe PDF | 檢視/開啟 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。