國立臺灣大學資訊工程學系Hsieh, Sun-YuanSun-YuanHsiehChen, Gen-HueyGen-HueyChenHo, Chin-WenChin-WenHo2006-09-272018-07-052006-09-272018-07-052000-01http://ntur.lib.ntu.edu.tw//handle/246246/20060927122911257271The 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.application/pdf158175 bytesapplication/pdfzh-TWreporthttp://ntur.lib.ntu.edu.tw/bitstream/246246/20060927122911257271/1/star-00-01.pdf