{"references": ["F. Harary, J. P. Hayes, and H.-J. Wu, \"A survey of the theory of the\nhypercube graphs\", Comput. Math. Appl., 15, 1988, no. 4, pp. 277\u2013289.", "M. Kobeissi and M. Mollard, \"Disjoint cycles and spanning graphs of\nhypercubes\", Discrete Math., 288, 2004, no. 1-3, pp. 73\u201387.", "C.-H. Tsai, \"Cycles embedding in hypercubes with node failures\", Inf.\nProcess. Lett., 102, 2007, no. 6, pp. 242\u2013246.", "P. Cull and S.M. Larson, \"On generalized twisted cubes\", Inf. Process.\nLett., 55, 1995, pp.53\u201355.", "Y. Li and S. Peng, \"Dual-cubes: a new interconnection network\nfor high-performance computer clusters\", Proceedings of the\n2000 International Computer Symposium, Workshop on Computer\nArchitecture. Chia-Yi, Taiwan, Dec. 2000, 51\u201357.", "Z. Jiang and J. Wu, \"A limited-global information model for fault-tolerant\nrouting in dual-cube\", Int. J. Parallel Emergent and Distrib. Syst., 21,\n2006, no. 1, pp.61\u201377.", "C.-J. Lai and C.-H. Tsai, \"On embedding cycles into faulty dual-cubes\",\nInf. Process. Lett. , vol. 109, 2008, pp. 147\u2013150.", "Y. Li, S. Peng, and W. Chu, \"Efficient collective communications in\ndual-cube\", J. Supercomput., 28, 2004, pp.71\u201390.", "Y. Li, S. Peng, and W. Chu, \"Fault tolerant cycle embedding dual-cube\nwith node faults\", Int. J. High Performance Computing and Networking,\n3, 2005, no. 1, pp.45\u201353.\n[10] L.-H. Hsu and C.-K. Lin, Graph Theory and Interconnection Networks,\nCRC Press, Taylor and Francis Group, USA, 2009, ch. 1; ch. 9.\n[11] Y. Li, S. Peng, and W. Chu, \"Hamiltonian cycle embedding for\nfault tolerance in dual-cube\", Proceedings of the IASTED International\nConference on Networks, Parallel and Distributing Processing, and\nApplications, 2002, pp. 1\u20136.\n[12] Y.-K. Shih, H.-C. Chuang, S.-S. Kao and J. J.-M. Tan, \"Mutually\nindependent hamiltonian cycles in Dual-cubes\", J. Supercomput., 54,\n2010, pp. 239\u2013251. [13] J.-C. Chen and C.-H. Tsai, \"Conditional edge-fault-tolerant hamiltonicity\nof dual-cubes\", Inf. Sci., 181, 2011, pp.620\u2013627.\n[14] Y.A. Ashir and I.A. Stewart, \"Fault-tolerant embedding of Hamiltonian\ncircuits in k-ary n-cube\", SIAM Journal on Discrete Mathematics, 15(3),\n2002, pp. 317\u2013328.\n[15] M.Y. Chan and S.-J. Lee, \"On the existence of hamiltonian circuits in\nfaulty hypercubes\", SIAM Journal on Discrete Mathematics, 4(4), 1991,\npp.511-527.\n[16] P.K. Jha, \"1-Perfect codes over dual-cubes vis-`a-vis hamming codes over\nhypercubes\", IEEE Trans. Inf. Theory, 61, no. 8, 2015, pp. 4259\u20134268.\n[17] S.-Y. Chen and S.-S. Kao, \"Hamiltonian connectivity and globally\n3*-connected of Dual-cube Extensive Networks\", Comput. Electr. Eng.,\n36, 2010, pp. 404-413.\n[18] A. Angjeli, E. Cheng, and L. Lipt\u00b4ak, \"Linearly many faults in\ndual-cube-like networks\", Theor. Comput. Sci., 472, 2013, pp.1-8."]}

In this paper, a thorough review about dual-cubes, DCn, the related studies and their variations are given. DCn was introduced to be a network which retains the pleasing properties of hypercube Qn but has a much smaller diameter. In fact, it is so constructed that the number of vertices of DCn is equal to the number of vertices of Q2n +1. However, each vertex in DCn is adjacent to n + 1 neighbors and so DCn has (n + 1) × 2^2n edges in total, which is roughly half the number of edges of Q2n+1. In addition, the diameter of any DCn is 2n +2, which is of the same order of that of Q2n+1. For selfcompleteness, basic definitions, construction rules and symbols are provided. We chronicle the results, where eleven significant theorems are presented, and include some open problems at the end.