Abstract
AbstractIn this paper, we study the maximal length of cycle embedding in a faulty wrapped butterfly graph BFn with at most two faults in vertices and/or edges. When there is one vertex fault and one edge fault, we prove that the maximum cycle length is n2n − 2 if n is even and n2n − 1 if n is odd. When there are two faulty vertices, the maximum cycle length is n2n − 2 for odd n. All these results are optimal because the wrapped butterfly graph is bipartite if and only if n is even. © 2003 Wiley Periodicals, Inc.
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.
