Embedding Hamiltonian Paths in $k$-Ary $n$-Cubes With Exponentially-Many Faulty Edges

Embedding cycles into a network topology is crucial for a network simulation. In particular, embedding Hamiltonian cycles is a major requirement for designing good interconnection networks. A graph G is called r-spanning cyclable if, for any r distinct vertices v1,v2,…,vr of G, there exist r cycles C1,C2,…,Cr in G such that vi is on Ci for every i, and every vertex of G is on exactly one cycle Ci. If r=1, this is the classical Hamiltonian problem. In this paper, we focus on the problem of embedding spanning disjoint cycles in bipartite k-ary n-cubes. Let k≥4 be even and n≥2. It is shown that the n-dimensional bipartite k-ary n-cube Qnk is m-spanning cyclable with m≤2n−1. Considering the degree of Qnk, the result is optimal.

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

hi@scite.ai

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Embedding Hamiltonian Paths in $k$-Ary $n$-Cubes With Exponentially-Many Faulty Edges

Cited by 3 publications

References 42 publications

Shortest node-to-node disjoint paths algorithm for symmetric networks

Shortest node-to-node disjoint paths algorithm for symmetric networks

Enabling high fault-tolerant embedding capability of alternating group graphs

On the Spanning Cyclability of k-ary n-cube Networks

Contact Info

Product

Resources

About