The capability of fault tolerance is one of the advantages of multiprocessor systems. In this paper, we shall prove the fault tolerance of star graphs is 2n-5 shall propose an algorithm for examining the connecalgorithm requires O(n310gn) tame. Besides, we im-Bagherzadeh et al. [5] by calculating the cycle structure sage to a node without another nonfaulty neighbors. we shall propose an efficient fault-tolerant broadcasting algorithm. When no fault occurs, our broadcasting algorithm remains optimal. And the penalty is O(n2) if at most n-2 faults exist. with restriction to the forbidden faulty set. And we 1324 4321 tivity of star graphs when 2n-4 faults exist. The 3412 2413
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.