Abstract
This paper computes the exact fault diameter of the star graph. The fault diameter of a graph is the maximum diameter achievable, when we delete from the original graph any set of nodes that is smaller than its vertex connectivity. We show that for S 3 and S 4 the exact fault diameter is the original diameter plus two, and for S n , n>4, the fault diameter is the original diameter plus one.
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.
