Abstract
Twisted cubes are attractive alternatives to hypercubes. In this paper, we study a stronger pancyclicity of twisted cubes. We prove that the n-dimensional twisted cube is edge-pancyclic for n ≥ 3. That is, for any (x,y) ∈ E(TQ n ) (n ≥ 3) and any integer l with 4 ≤ l ≤ 2 n , a cycle C of length l can be embedded with dilation 1 into TQ n such that (x,y) is in C. It is clear that an edge-pancyclic graph is also a node-pancyclic graph. Therefore, TQ n is also a node-pancyclic graph for n ≥ 3.
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.
