Abstract

A graph G=(V, E) is said to be pancyclic if it contains fault-free cycles of all lengths from 4 to |V| in G. Let F/sub v/ and F/sub e/ be the sets of faulty nodes and faulty edges of an n-dimensional Mobius cube MQ/sub n/, respectively, and let F=F/sub v//spl cup/F/sub e/. A faulty graph is pancyclic if it contains fault-free cycles of all lengths from 4 to |V-F/sub v/|. In this paper, we show that MQ/sub n/-F contains a fault-free Hamiltonian path when |F|/spl les/n-1 and n/spl ges/1. We also show that MQ/sub n/-F is pancyclic when |F|/spl les/n-2 and n/spl ges/2. Since MQ/sub n/ is regular of degree n, both results are optimal in the worst case.

Full Text
Paper version not known

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 call

Disclaimer: 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.