| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 427300 | Information Processing Letters | 2011 | 7 Pages |
Bijective connection graphs (in brief, BC graphs) are a family of hypercube variants, which contains hypercubes, twisted cubes, crossed cubes, Möbius 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, Möbius 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⌈n/3⌉+3 for any integer n with n⩾14n⩾14. It is the first time in literature that a hypercube variant with such a small diameter is presented.
► Proposing the definition of spined cubes. ► Proving n -dimensional spined cube has diameter [n/3]+3[n/3]+3. ► Giving smallest diameter of all existing hypercube variants.
