Abstract
The arrangement graph An,k is a well-known interconnection network. Day and Tripathi proved that An,k is pancyclic for n-k⩾2. In this paper, we improve this result, and we demonstrate that An,k is also pancyclic even if it has no more than (k(n-k)-2) faulty edges for n-k⩾2. Our result is optimal concerning the edge fault-tolerance.
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.
