Abstract
In this paper, we study the embedding of cycles in twisted cubes. It has been proven in the literature that, for any integer l, 4≤l≤2n, a cycle of length l can be embedded with dilation 1 in an n-dimensional twisted cube, n≥3. We obtain a stronger result of embedding of cycles with edge-pancyclic. We prove that, for any integer l, 4≤l≤2n, and a given edge (x,y) in an n-dimensional twisted cube, n≥3, a cycle C of length l can be embedded with dilation 1 in the n-dimensional twisted cube such that (x,y) is in C in the twisted cube. Based on the proof of the edge-pancyclicity of twisted cubes, we further provide an O(llog l+n 2+nl) algorithm to find a cycle C of length l that contains (u,v) in TQ n for any (u,v)∈E(TQ n ) and any integer l with 4≤l≤2n.
Similar content being viewed by others
References
Abraham, S., Padmanabhan, K.: The twisted cube topology for multiprocessors: a study in networks asymmetry. J. Parallel Distrib. Comput. 13(1), 104–110 (1991)
Abuelrub, E., Bettayeb, S.: Embedding of complete binary trees in twisted hypercubes. In: Proc. Int’l Conf. Computer Applications in Design, Simulation, and Analysis, pp. 1–4 (1993)
Alspach, B., Hare, D.: Edge-pancyclic block-intersection graphs. Discret. Math. 97, 17–24 (1991)
Araki, T.: Edge-pancyclicity of recursive circulants. Inf. Process. Lett. 88, 287–292 (2003)
Auletta, L., Rescigno, A.A., Scarano, V.: Embedding graphs onto the supercube. IEEE Trans. Comput. 44(4), 593–597 (1995)
Bang-Jansen, J., Guo, Y.: A note on vertex pancyclic oriented graphs. J. Graph Theory 31, 313–318 (1999)
Chang, C.-P., Wang, J.-N., Hsu, L.-H.: Topological properties of twisted cubes. Inf. Sci. 113, 147–167 (1999)
Fan, J., Lin, X.: The t/k-diagnosability of the BC graphs. IEEE Trans. Comput. 54(2), 176–184 (2005)
Fan, J., Lin, X., Jia, X.: Optimal path embedding in crossed cubes. IEEE Trans. Parallel Distrib. Syst. 16(12), 1190–1200 (2005)
Fan, J., Lin, X., Jia, X.: Node-pancyclicity and edge-pancyclicity of crossed cubes. Inf. Process. Lett. 93, 133–138 (2005)
Fu, J.-S.: Fault-tolerant cycle embedding in the hypercube. Parallel Comput. 29(6), 821–832 (2003)
Hilbers, P.A.J., Koopman, M.R.J., Van de Snepscheut, J.L.A.: The twisted cube. In: deBakker, J., Numan, A., Trelearen, P. (eds.) PARLE: Parallel Architectures and Languages Europe. Parallel Architectures, vol. 1, pp. 152–158. Springer, Berlin (1987)
Hsu, H.-C., Li, T.-K., Tan, J.J.M., Hsu, L.-H.: Fault Hamiltonicity and fault Hamiltonian connectivity of the arrangement graphs. IEEE Trans. Comput. 53(1), 39–53 (2004)
Huang, W.-T., Tan, J.J.M., Hung, C.-N., Hsu, L.-H.: Fault-tolerant Hamiltonicity of twisted cubes. J. Parallel Distrib. Comput. 62, 591–604 (2002)
Kulasinghe, P., Bettayeb, S.: Embedding binary trees into crossed cubes. IEEE Trans. Comput. 44(7), 923–929 (1995)
Lih, K.-W., Zengmin, S., Weifan, W., Kemin, Z.: Edge-pancyclicity of coupled graphs. Discret. Appl. Math. 119, 259–264 (2002)
Randerath, B., Schiermeyer, I., Tewes, M., Volkmann, L.: Vertex pancyclic graphs. Discret. Appl. Math. 120, 219–237 (2002)
Yang, M.-C., Li, T.-K., Tan, J.J.M., Hsu, L.-H.: Fault-tolerant cycle-embedding of crossed cubes. Inf. Process. Lett. 88(4), 149–154 (2003)
Yang, M.-C., Li, T.-K., Tan, J.J.M., Hsu, L.-H.: On embedding cycles into faulty twisted cubes. Inf. Sci. 176, 676–690 (2006)
Yang, P.-J., Tien, S.-B., Raghavendra, C.S.: Embedding of rings and meshes onto faulty hypercubes using free dimensions. IEEE Trans. Comput. 43(5), 608–613 (1994)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Fan, J., Jia, X. & Lin, X. Embedding of Cycles in Twisted Cubes with Edge-Pancyclic. Algorithmica 51, 264–282 (2008). https://doi.org/10.1007/s00453-007-9024-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-007-9024-7