Embedding spanning disjoint cycles in augmented cube networks with prescribed vertices in each cycle

Wu, Weixing; Sabir, Eminjan; Qiao, Hongwei

doi:10.1080/17445760.2023.2231162

International Journal of Parallel, Emergent and Distributed Sys

2023

DOI: 10.1080/17445760.2023.2231162

|View full text |Cite

Embedding spanning disjoint cycles in augmented cube networks with prescribed vertices in each cycle

Weixing Wu

Eminjan Sabir

Hongwei Qiao

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

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

Qiao,

Zhang

2024

Symmetry

View full text Add to dashboard Cite

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

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

Qiao,

Zhang

2024

Symmetry

View full text Add to dashboard Cite

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

customersupport@researchsolutions.com

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

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

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 spanning disjoint cycles in augmented cube networks with prescribed vertices in each cycle

Cited by 1 publication

References 28 publications

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

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

Contact Info

Product

Resources

About