The twisted cube topology for multiprocessors: a study in network asymmetry
Journal of Parallel and Distributed Computing
A Variation on the Hypercube with Lower Diameter
IEEE Transactions on Computers
IEEE Transactions on Computers
A Linear Equation Model for Twisted Cube Networks
Proceedings of the 1994 International Conference on Parallel and Distributed Systems
The t/k-Diagnosability of the BC Graphs
IEEE Transactions on Computers
Edge-pancyclicity and path-embeddability of bijective connection graphs
Information Sciences: an International Journal
Logic and Computer Design in Nanospace
IEEE Transactions on Computers
Minimum neighborhood in a generalized cube
Information Processing Letters
Efficient unicast in bijective connection networks with the restricted faulty node set
Information Sciences: an International Journal
An algorithm to construct independent spanning trees on parity cubes
Theoretical Computer Science
Parallel construction of independent spanning trees and an application in diagnosis on Möbius cubes
The Journal of Supercomputing
| Hi-index | 0.89 |
Bijective connection graphs (in brief, BC graphs) are a family of hypercube variants, which contains hypercubes, twisted cubes, crossed cubes, Mobius cubes, locally twisted cubes, etc. It was proved that the smallest diameter of all the known n-dimensional bijective connection graphs (BC graphs) is @?n+12@?, given a fixed dimension n. An important question about the smallest diameter among all the BC graphs is: Does there exist a BC graph whose diameter is less than the known BC graphs such as crossed cubes, twisted cubes, Mobius cubes, etc., with the same dimension? This paper answers this question. In this paper, we find that there exists a kind of BC graphs called spined cubes and we prove that the n-dimensional spined cube has the diameter @?n/3@?+3 for any integer n with n=14. It is the first time in literature that a hypercube variant with such a small diameter is presented.