Author:
Chen Dan,Lu Zhongzhou,Shen Zebang,Zhang Gaofeng,Chen Chong,Zhou Qingguo
Abstract
The balanced hypercube network, which is a novel interconnection network for parallel computation and data processing, is a newly-invented variant of the hypercube. The particular feature of the balanced hypercube is that each processor has its own backup processor and they are connected to the same neighbors. A Hamiltonian bipartite graph with bipartition
V
0
∪
V
1
x
∈
V
0
y
∈
V
1
. It is known that each edge is on a Hamiltonian cycle of the balanced hypercube. In this paper, we prove that, for an arbitrary edge
e
in the balanced hypercube, there exists a Hamiltonian path between any two vertices
x
and
y
in different partite sets passing through
e
with
e
≠
x
y
. This result improves some known results.
Subject
Physics and Astronomy (miscellaneous),General Mathematics,Chemistry (miscellaneous),Computer Science (miscellaneous)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献