Linear layout of locally twisted cubes

References

• M. Arockiaraj, J. Quadras, I. Rajasingh, and A.J. Shalini, Embedding hypercubes and folded hypercubes onto cartesian product of certain trees, Discrete Optim. 17 (2015), pp. 1–13. doi: 10.1016/j.disopt.2015.03.001
   Web of Science ®Google Scholar
• S.L. Bezrukov, Edge isoperimetric problems on graphs, in Graph Theory and Combinatorial Biology (7), L. Lová sz, A. Gyarfas, G.O.H. Katona, A. Recski, and L. Szekely, eds., Bolyai Soc. Math. Stud., Budapest, 1999, pp. 157–197.
   Google Scholar
• S.L. Bezrukov, J.D. Chavez, L.H. Harper, M. Röttger, and U.-P. Schroeder, Embedding of hypercubes into grids, Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science, Springer-Verlag, Brno, Czech Republic, 1998, pp. 693–701.
   Google Scholar
• S. Bezrukov, B. Monien, W. Unger, and G. Wechsung, Embedding ladders and caterpillars into the hypercube, Discrete Appl. Math. 83(1–3) (1998), pp. 21–29. doi: 10.1016/S0166-218X(97)00101-7
   Web of Science ®Google Scholar
• S.L. Bezrukov, J.D. Chavez, L.H. Harper, M. Röttger, and U.-P. Schroeder, The congestion of n-cube layout on a rectangular grid, Discrete Math. 213(1) (2000), pp. 13–19. doi: 10.1016/S0012-365X(99)00162-4
   Web of Science ®Google Scholar
• S.L. Bezrukov, S.K. Das, and R. Elsässer, An edge-isoperimetric problem for powers of the petersen graph, Ann. Comb. 4(2) (2000), pp. 153–169. doi: 10.1007/s000260050003
   Google Scholar
• A.J. Boals, A.K. Gupta, and N.A. Sherwani, Incomplete hypercubes: algorithms and embeddings, J. Supercomput. 8(3) (1994), pp. 263–294. doi: 10.1007/BF01204731
   Web of Science ®Google Scholar
• Q.-Y. Chang, M.-J. Ma, and J.-M. Xu, Fault-tolerant pancyclicity of locally twisted cubes, J. China Univ. Sci. Tech. 36(6) (2006), pp. 607–610.
   Google Scholar
• F.B. Chedid and R.B. Chedid, A new variation on hypercubes with smaller diameter, Inform. Process Lett. 46(6) (1993), pp. 275–280. doi: 10.1016/0020-0190(93)90065-H
   Web of Science ®Google Scholar
• H.-L. Chen and N.-F. Tzeng, A boolean expression-based approach for maximum incomplete subcube identification in faulty hypercubes, IEEE Trans. Parallel Distrib. Syst. 8(11) (1997), pp. 1171–1183. doi: 10.1109/71.642951
   Web of Science ®Google Scholar
• S.A. Choudum and V. Sunitha, Augmented cubes, Networks 40(2) (2002), pp. 71–84. doi: 10.1002/net.10033
   Web of Science ®Google Scholar
• P. Cull and S.M. Larson, The Möbius cubes, IEEE Trans. Comput. 44(5) (1995), pp. 647–659. doi: 10.1109/12.381950
   Web of Science ®Google Scholar
• J. Diaz, J. Petit, and M. Serna, A survey of graph layout problems, Comput. Surveys 34(3) (2002), pp. 313–356. doi: 10.1145/568522.568523
   Web of Science ®Google Scholar
• K. Efe, A variation on the hypercube with lower diameter, IEEE Trans. Comput. 40(11) (1991), pp. 1312–1316. doi: 10.1109/12.102840
   Web of Science ®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. doi: 10.1109/12.67323
   Web of Science ®Google Scholar
• M.R. Garey and D.S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979.
   Google Scholar
• Y. Han, J. Fan, J. Yang, and P. Qian, Path embedding in faulty locally twisted cubes, Second IEEE International Conference on Computer Science and Information Technology, 2009, pp. 214–218.
   Google Scholar
• Y. Han, J. Fan, S. Zhang, J. Yang, and P. Qian, Embedding meshes into locally twisted cubes, Inform. Sci. 180(19) (2010), pp. 3794–3805. doi: 10.1016/j.ins.2010.06.001
   Web of Science ®Google Scholar
• Y. Han, J. Fan, and S. Zhang, Changing the diameter of the locally twisted cube, Int. J. Comput. Math. 90(3) (2013), pp. 497–510. doi: 10.1080/00207160.2012.742190
   Web of Science ®Google Scholar
• L.H. Harper, Global Methods for Combinatorial Isoperimetric Problems, Cambridge University Press, Cambridge, UK, 2004.
   Google Scholar
• W.D. Hillis, The Connection Machine, MIT Press, Cambridge, MA, 1989.
   Google Scholar
• S.-Y. Hsieh and C.-J. Tu, Constructing edge-disjoint spanning trees in locally twisted cubes, Theor. Comput. Sci. 410(8) (2009), pp. 926–932. doi: 10.1016/j.tcs.2008.12.025
   Web of Science ®Google Scholar
• S.-Y. Hsieh and C.-Y. Wu, Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults, J. Comb. Optim. 19(1) (2010), pp. 16–30. doi: 10.1007/s10878-008-9157-x
   Web of Science ®Google Scholar
• K.S. Hu, S.-S. Yeoh, C. Chen, and L.-H. Hsu, Node-pancyclicity and edge-pancyclicity of hypercube variants, Inform. Process. Lett. 102(1) (2007), pp. 1–7. doi: 10.1016/j.ipl.2006.10.008
   Web of Science ®Google Scholar
• H.P. Katseff, Incomplete hypercubes, IEEE Trans. Comput. 37(5) (1988), pp. 604–608. doi: 10.1109/12.4611
   Web of Science ®Google Scholar
• M. Ma and J.-M. Xu, Panconnectivity of locally twisted cubes, Appl. Math. Lett. 19(7) (2006), pp. 673–677. doi: 10.1016/j.aml.2005.08.021
   Web of Science ®Google Scholar
• M. Ma and J.-M. Xu, Weak Edge-pancyclicity of locally twisted cubes, Ars. Comb. 89 (2008), pp. 89–94.
   Web of Science ®Google Scholar
• P. Manuel, I. Rajasingh, B. Rajan, and H. Mercy, Exact wirelength of hypercubes on a grid, Discrete Appl. Math. 157(7) (2009), pp. 1486–1495. doi: 10.1016/j.dam.2008.09.013
   Web of Science ®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
• I. Rajasingh and M. Arockiaraj, Linear wirelength of folded hypercubes, Math. Comput. Sci. 5(1) (2011), pp. 101–111. doi: 10.1007/s11786-011-0085-2
   Google Scholar
• H. Yang and X. Yang, A fast diagnosis algorithm for locally twisted cube multiprocessor systems under the MM* model, Comput. Math. Appl. 53(6) (2007), pp. 918–926. doi: 10.1016/j.camwa.2006.09.008
   Web of Science ®Google Scholar
• X. Yang, G.M. Megson, and D.J. Evans, Locally twisted cubes are 4-pancyclic, Appl. Math. Lett. 17 (2004), pp. 919–925. doi: 10.1016/j.aml.2003.10.009
   Web of Science ®Google Scholar
• X. Yang, D.J. Evans, and G.M. Megson, The locally twisted cubes, Int. J. Comput. Math. 82(4) (2005), pp. 401–413. doi: 10.1080/0020716042000301752
   Web of Science ®Google Scholar
• L. You and Y. Han, An algorithm to embed a family of node-disjoint 3D meshes into locally twisted cubes, Algorithms and Architectures for Parallel Processing, Lecture Notes in Computer Science, Springer International Publishing, Dalian, China, 2014, pp. 219–230.
   Google Scholar