.png){kind=icon}
Return
Two node-disjoint paths in balanced hypercubes
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2014.05.037.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The balanced hypercube BHn proposed by Wu and Huang is a variation of the hypercube. It has been proved that the balanced hypercube is a node-transitive and bipartite graph. Assume that the nodes are divided into two bipartite node sets X and Y, u and x are two different nodes in X, and v and y are two different nodes in Y. In this paper, we prove that there exist two node-disjoint paths P[x, y] and R[u, v] in BHn, and V(P[x, y]) boolean OR V(R[u, v]) - V(BHn), where n >= 1. The Hamiltonian laceability of BHn which was proved by Xu et al. is also obtained from the corollary of our result. (C) 2014 Elsevier Inc. All rights reserved.
Keywords:
Balanced hypercube
Path
Embedding
Node-disjoint
Interconnection network
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
Cited Papers
.png){kind=icon}
ShareSaveEmbedding Cycles and Paths in Product Networks and Their Applications to Multiprocessor Systems
PREAI
ShareSaveShareSaveChannel estimation and error correction for UWOC system with vertical non-line-of-sight channel
PREAI
ShareSaveEmbedding a Hamiltonian cycle in the crossed cube with two required vertices in the fixed positions
PREAI
ShareSaveShareSave
View more