The bicube: an interconnection of two hypercubes

References

• S. Abraham and K. Padmanabhan, The twisted cube topology for multiprocessors: A study in network asymmetry, J. Parallel Distrib. Comput. 13 (1991), pp. 104–110.
   Google Scholar
• J.A. Bondy and U.S.R. Murty, Graph Theory with Applications, 5th printing, American Elsevier Publishing Co., Inc., New York, 1976.
   Google Scholar
• F.B. Chedid, On the generalized twisted cube, Inform. Proc. Lett. 55 (1995), pp. 49–52. doi: 10.1016/0020-0190(95)00054-G
   Web of Science ®Google Scholar
• P. Cull and S. Larson, The Möbius cubes, IEEE Trans. Comput. 44(5) (1995), pp. 647–659.
   Google Scholar
• P. Cull and S. Larson, Smaller diameters in hypercube-variant networks, Telecommun. Syst. 10 (1998), pp. 175–184. doi: 10.1023/A:1019167000458
   Web of Science ®Google Scholar
• K. Efe, A variation on the hypercube with lower diameter, IEEE Trans. Comput. 40(11) (1991), pp. 1312–1316.
   Google Scholar
• K. Efe, The crossed cube architecture for parallel computation, IEEE Trans. Parallel Distrib. Syst. 3(5) (1992), pp. 513–524.
   Google Scholar
• A. El-Amawy and S. Latifi, Properties and performance of folded hypercubes, IEEE Trans. Parallel Distrib. Syst. 2(1) (1991), pp. 31–42.
   Google Scholar
• A.-H. Esfahanian, L.M. Ni, and B.E. Sagan, The twisted n-cube with application to multiprocessing, IEEE Trans. Comput. 40(1) (1991), pp. 88–93.
   Google Scholar
• J. Fang, The bipanconnectivity and m-panconnectivity of the folded hypercube, Theor. Comput. Sci. 385 (2007), pp. 286–300. doi: 10.1016/j.tcs.2007.07.005
   Web of Science ®Google Scholar
• C.M. Hartman, Extremal problems in graph theory, Ph.D. thesis, Department of Mathematics, University of Illinois at Urbana-Champaign, 1997.
   Google Scholar
• P.A.J. Hilbers, M.R.J. Koopman, and J.L.A. van de Snepscheut, The twisted cube, in PARLE: Parallel Architectures and Languages Europe, J. Bakker, A. Nijman, and P. Treleaven, eds., Vol. I: Parallel Architectures, Springer, Berlin, 1987, pp. 152–159.
   Google Scholar
• C.-T. Ho, An observation on the bisectional interconnection networks, IEEE Trans. Comput. 41(7) (1992), pp. 873–877.
   Google Scholar
• S.-Y. Hsieh and T.-T. Hsiao, The k-degree Cayley graph and its topological properties, Networks 47(1) (2006), pp. 26–36.
   Google Scholar
• S. Jo, J.-H. Park, and K.Y. Chwa, Paired 2-disjoint path covers and strongly hamiltonian laceability of bipartite hypercube-like graphs, Inform. Sci. 242 (2013), pp. 103–112. doi: 10.1016/j.ins.2013.04.013
   Web of Science ®Google Scholar
• J.-H. Lee and J.-H. Park, General-demand disjoint path covers in a graph with faulty elements, Int. J. Comput. Math. 89(5) (2012), pp. 606–617. doi: 10.1080/00207160.2012.656614
   Web of Science ®Google Scholar
• F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufman, San Mateo, CA, 1992.
   Google Scholar
• C.-K. Lin, Y.-H. Teng, J.M. Tan, L.-H. Hsu, and D. Marusic, The spanning laceability on the faulty bipartite hypercube-like graphs, Appl. Math. Comput. 219(15) (2013), pp. 8095–8103. doi: 10.1016/j.amc.2013.02.027
   Web of Science ®Google Scholar
• J.-H. Park and K.Y. Chwa, Recursive circulants and their embeddings among hypercubes, Theor. Comput. Sci. 244 (2000), pp. 35–62. doi: 10.1016/S0304-3975(00)00176-6
   Web of Science ®Google Scholar
• C.-D. Park and K.Y. Chwa, Hamiltonian properties on the class of hypercube-like networks, Inform. Proc. Lett. 91 (2004), pp. 11–17. doi: 10.1016/j.ipl.2004.03.009
   Web of Science ®Google Scholar
• J.-H. Park, H.-C. Kim, and H.-S. Lim, Fault-hamiltonicity of hypercube-like interconnection networks, 19th IEEE International Parallel and Distributed Processing Symposium, Denver, CO, 4–8 April 2005.
   Google Scholar
• J.-H. Park, H.-C. Kim, and H.-S. Lim, Many-to-many disjoint path covers in hypercube-like interconnection networks with faulty elements, IEEE Trans. Parallel Distrib. Syst. 17(3) (2006), pp. 227–240.
   Google Scholar
• J.-H. Park, H.-S. Lim, and H.-C. Kim, Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements, Theor. Comput. Sci. 377(1–3) (2007), pp. 170–180. doi: 10.1016/j.tcs.2007.02.029
   Web of Science ®Google Scholar
• J.-H. Park, H.-C. Kim, and H.-S. Lim, Many-to-many disjoint path covers in hypercube-like interconnection networks, IEEE Trans. Comput. 58(4) (2009), pp. 528–540.
   Google Scholar
• N.K. Singhvi and K. Ghose, The Mcube: A symmetrical cube based network with twisted links, 9th IEEE International Parallel Processing Symposium, Santa Barbara, CA, 25–28 April 1995, pp. 11–16.
   Google Scholar
• N. Tzeng and S. Wei, Enhanced hypercubes, IEEE Trans. Comput. 40(3) (1991), pp. 284–294. doi: 10.1109/12.76405
   Web of Science ®Google Scholar
• A.S. Vaidya, P.S.N. Rao, and S.R. Shankar, A class of hypercube-like networks, 5th IEEE Symposium on Parallel and Distributed Processing, Dallas, TX, 1–4 December 1993, pp. 800–803.
   Google Scholar
• X. Yang, D.J. Evans, and G.M. Megson, The locally twisted cubes, Int. J. Comput. Math. 82(4) (2005), pp. 402–413.
   Web of Science ®Google Scholar
• W. Zhou, J. Fan, X. Jia, and S. Zhang, The Spined cube: A new hypercube variant with smaller diameter, Inform. Proc. Lett. 111 (2011), pp. 561–567. doi: 10.1016/j.ipl.2011.03.011
   Web of Science ®Google Scholar