Dept. of Comput. Sci. & Inf. Eng., National Taiwan Univ.Hsieh, Sun-YuanSun-YuanHsiehGEN-HUEY CHENHo, Chin-WenChin-WenHo2007-04-192018-07-052007-04-192018-07-051998-08https://www.scopus.com/inward/record.uri?eid=2-s2.0-0002241611&doi=10.1109%2fICPP.1998.708473&partnerID=40&md5=51f91f6eecf458399dccdeeabf2a709fThe star graph has been recognized as an attractive alternative to the hypercube. Let Fe and Fν be the sets of vertex faults and edge faults, respectively. Previously, Tseng et al. showed that an n-dimensional star graph can embed a ring of length n! if |Fe|≤n-3 (|Fν|=0), and a ring of length at least n!-4|Fν| if |Fν|≤n-3 (|Fe|=0). Since an n-dimensional star graph is regular of degree n-1 and is bipartite with two partite sets of equal size, our result achieves optimality in the worst case. © 1998 IEEE.application/pdf83348 bytesapplication/pdfen-USA-RINGS; Edge faults; Equal sizes; Hypercube; Optimality; Partite sets; Star graphsjournal article10.1109/ICPP.1998.7084732-s2.0-0002241611http://ntur.lib.ntu.edu.tw/bitstream/246246/2007041910021752/1/00708473.pdf