Abstract
In this paper we give new results on the fault-tolerance capabilities of the star graph. We first consider the problem of determining the maximum number r(n) of vertices in a n! vertices star graph S n such that by removing any set of vertices and/or edges from S n of cardinality at most r(n) the diameter of S n does not increase. Subsequently, we give an algorithm for broadcasting a message in S n in optimal time (the diameter of S n ) and using the minimum possible number of message transmissions, i.e., n! − 1, in presence of up to r(n) vertex or edge faults, assuming the set of faults is known to all vertices of the network. We also extend this result to the case in which there is no global knowledge on the faulty elements.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
