Abstract
Abstract A Hamiltonian graph G is said to be panpositionably Hamiltonian if, for any two distinct vertices x and y of G, there is a Hamiltonian cycle C of G having dC(x, y) = l for any integer l satisfying d G ( x , y ) ⩽ l ⩽ | V ( G ) | 2 , where dG(x, y) (respectively, dC(x, y)) denotes the distance between vertices x and y in G (respectively, C), and ∣V(G)∣ denotes the total number of vertices of G. As the importance of Hamiltonian properties for data communication among units in an interconnected system, the panpositionable Hamiltonicity involves more flexible message transmission. In this paper, we study this property with respect to the class of crossed cubes, which is a popular variant of the hypercube network.
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.
