Abstract
In this paper, we aim to embed longest fault-free paths in an n-dimensional star graph with edge faults. When n/spl ges/6 and there are n-3 edge faults, a longest fault-free path can be embedded between two arbitrary distinct vertices, exclusive of two exceptions in which at most two vertices are excluded. Since the star graph is regular of degree n-1, n-3 (edge faults) is maximal in the worst case. When n/spl ges/6 and there are n-4 edge faults, a longest fault-free path can be embedded between two arbitrary distinct vertices. The situation of n<6 is also discussed.
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.
