{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:34Z","timestamp":1759638934266},"reference-count":31,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. &amp; Syst."],"published-print":{"date-parts":[[2018,12,1]]},"DOI":"10.1587\/transinf.2018pap0009","type":"journal-article","created":{"date-parts":[[2018,11,30]],"date-time":"2018-11-30T22:27:44Z","timestamp":1543616864000},"page":"2916-2921","source":"Crossref","is-referenced-by-count":2,"title":["Cycle Embedding in Generalized Recursive Circulant Graphs"],"prefix":"10.1587","volume":"E101.D","author":[{"given":"Shyue-Ming","family":"TANG","sequence":"first","affiliation":[{"name":"Department of Psychology and Social Work, National Defense University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yue-Li","family":"WANG","sequence":"additional","affiliation":[{"name":"Department of Information Management, National Taiwan University of Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chien-Yi","family":"LI","sequence":"additional","affiliation":[{"name":"Department of Information Management, National Taiwan University of Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jou-Ming","family":"CHANG","sequence":"additional","affiliation":[{"name":"Institute of Information and Decision Sciences, National Taipei University of Business"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] S.B. Akers and B. Krishnamurthy, \u201cA Group-theoretic model for symmetric interconnection networks,\u201d IEEE Tran. Comput., vol.38, no.4, pp.555-566, 1989. 10.1109\/12.21148","DOI":"10.1109\/12.21148"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] T. Araki, \u201cEdge-pancyclicity of recursive circulants,\u201d Inf. Process. Lett., vol.88, no.6, pp.287-292, 2003. 10.1016\/j.ipl.2003.09.003","DOI":"10.1016\/j.ipl.2003.09.003"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] T. Araki and Y. Shibata, \u201cPancyclicity of recursive circulant graphs,\u201d Inf. Process. Lett., vol.81, no.4, pp.187-190, 2002. Erratum, vol.84, no.3, p.173, 2002.","DOI":"10.1016\/S0020-0190(01)00226-5"},{"key":"4","unstructured":"[4] N. Biggs, Algebraic Graph Theory, 2nd edition, Cambridge University Press, 1993."},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] D.K. Biss, \u201cHamiltonian decomposition of recursive circulant graphs,\u201d Discrete Math., vol.214, no.1-3, pp.89-99, 2000. 10.1016\/s0012-365x(99)00199-5","DOI":"10.1016\/S0012-365X(99)00199-5"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] L.N. Bhuyan, and D.P. Agrawal, \u201cGeneralized hypercube and hyperbus structures for a computer network,\u201d IEEE Tran. Comput., vol.33, no.4, pp.323-333, 1984 10.1109\/tc.1984.1676437","DOI":"10.1109\/TC.1984.1676437"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] F.T. Boesch and R. Tindell, \u201cCirculants and their connectivity,\u201d J. Graph Theory, vol.8, no.4, pp.487-499, 1984. 10.1002\/jgt.3190080406","DOI":"10.1002\/jgt.3190080406"},{"key":"8","unstructured":"[8] F. Buckley and F. Harary, Distance in Graphs, Addison-Wesley, Redwood City, CA, 1990."},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] Y.-C. Chen and T.-H. Tsai, \u201cHamiltonian decomposition of generalized recursive circulant graphs,\u201d Inf. Process. Lett., vol.116, no.9, pp.585-589, 2016. 10.1016\/j.ipl.2016.04.003","DOI":"10.1016\/j.ipl.2016.04.003"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] Y.-C. Chen, L.-H. Hsu, and J.J.-M. Tan, \u201cA recursively construction scheme for super fault-tolerant hamiltonian graphs,\u201d Appl. Math. Comput., vol.177, no.2, pp.465-481, 2006. 10.1016\/j.amc.2005.11.023","DOI":"10.1016\/j.amc.2005.11.023"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] D. Choi and I. Chung, \u201cApplication of the Hamiltonian circuit Latin square to a parallel routing algorithm on generalized recursive circulant networks,\u201d J. Korea Multimedia Society, vol.18, no.9, pp.1083-1090, 2015. 10.9717\/kmms.2015.18.9.1083","DOI":"10.9717\/kmms.2015.18.9.1083"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] I. Chung, \u201cConstruction of a parallel and shortest routing algorithm on recursive circulant networks,\u201d Proc. 4th International Conference on High Performance Computing in the Asia-Pacific Region, Beijing, China, pp.580-585, 2000. 10.1109\/hpc.2000.843501","DOI":"10.1109\/HPC.2000.843501"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] L.-H. Hsu and C.-K. Lin, Graph Theory and Interconnection Networks, CRC Press, Boca Raton, FL, 2008.","DOI":"10.1201\/9781420044829"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] C. Kim, J. Choi, and H.-S. Lim, \u201cEmbedding full ternary trees into recursive circulants,\u201d Proc. First EurAsian Conference on Information and Communication Technology, Shiraz, Iran, pp.874-882, 2002. 10.1007\/3-540-36087-5_101","DOI":"10.1007\/3-540-36087-5_101"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] S. Kim and I. Chung, \u201cApplication of the special Latin square to a parallel routing algorithm on a recursive circulant network,\u201d Inf. Process. Lett., vol.66, no.3, pp.141-147, 1998. 10.1016\/s0020-0190(98)00050-7","DOI":"10.1016\/S0020-0190(98)00050-7"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] S.-Y. Kim, J.-H. Lee, and J.-H. Park, \u201cDisjoint path covers in recursive circulants <i>G<\/i>(2<i><sup>m<\/sup><\/i>,4) with faulty elements,\u201d Theoret. Comput. Sci., vol.412, no.35, pp.4636-4649, 2011.","DOI":"10.1016\/j.tcs.2011.04.045"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] S.-Y. Kim and J.-H. Park, \u201cPaired many-to-many disjoint path covers in recursive circulants <i>G<\/i>(2<i><sup>m<\/sup><\/i>,4),\u201d IEEE Tran. Comput., vol.62, no.12, pp.2468-2475, 2013. 10.1109\/tc.2012.133","DOI":"10.1109\/TC.2012.133"},{"key":"18","doi-asserted-by":"publisher","unstructured":"[18] H-.S. Lim, J.-H. Park, and K.-Y. Chwa, \u201cEmbedding trees in recursive circulants,\u201d Discrete Appl. Math., vol.69, no.1-2, pp.83-99, 1996. 10.1016\/0166-218x(95)00078-6","DOI":"10.1016\/0166-218X(95)00078-6"},{"key":"19","doi-asserted-by":"publisher","unstructured":"[19] S.A. Mane and B.N. Waphare, \u201cRegular connected bipancyclic spanning subgraphs of hypercubes,\u201d Comput. Math. Appl., vol.62, no.9, pp.3551-3554, 2011. 10.1016\/j.camwa.2011.08.071","DOI":"10.1016\/j.camwa.2011.08.071"},{"key":"20","doi-asserted-by":"publisher","unstructured":"[20] C. Micheneau, \u201cDisjoint Hamiltonian cycles in recursive circulant graphs,\u201d Inf. Process. Lett., vol.61, no.5, pp.259-264, 1997. 10.1016\/s0020-0190(97)00020-3","DOI":"10.1016\/S0020-0190(97)00020-3"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] J.-H. Park, \u201cPanconnectivity and edge-pancyclicity of faulty recursive circulant <i>G<\/i>(2<i><sup>m<\/sup><\/i>,4),\u201d Theoret. Comput. Sci., vol.390, no.1, pp.70-80, 2008.","DOI":"10.1016\/j.tcs.2007.10.016"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] J.-H. Park and K.-Y. Chwa, \u201cRecursive circulant: A new topology for multicomputer networks,\u201d Proc. International Symposium on Parallel Architectures, Algorithms and Networks, Kanazawa, Japan, pp.73-80, 1994. 10.1109\/ispan.1994.367162","DOI":"10.1109\/ISPAN.1994.367162"},{"key":"23","doi-asserted-by":"publisher","unstructured":"[23] J.-H. Park and K.-Y. Chwa, \u201cRecursive circulants and their embeddings among hypercubes,\u201d Theor. Comput. Sci., vol.244, no.1-2, pp.35-62, 2000. 10.1016\/s0304-3975(00)00176-6","DOI":"10.1016\/S0304-3975(00)00176-6"},{"key":"24","doi-asserted-by":"publisher","unstructured":"[24] I. Stojmenovi\u0107, \u201cMultiplicative circulant networks topological properties and communication algorithms,\u201d Discrete Appl. Math., vol.77, no.3, pp.281-305, 1997. 10.1016\/s0166-218x(96)00138-2","DOI":"10.1016\/S0166-218X(96)00138-2"},{"key":"25","doi-asserted-by":"publisher","unstructured":"[25] S.-M. Tang, Y.-L. Wang, and C.-Y. Li, \u201cGeneralized Recursive Circulant Graphs,\u201d IEEE Tran. Comput., vol.23, no.1, pp.87-93, 2012. 10.1109\/tpds.2011.109","DOI":"10.1109\/TPDS.2011.109"},{"key":"26","doi-asserted-by":"publisher","unstructured":"[26] C.-H. Tsai, J.J.M. Tan, Y.-C. Chuang, and L.-H. Hsu, \u201cHamiltonian properties of faulty recursive circulant graphs,\u201d J. Interconnection Networks, vol.3, no.3-4, pp.273-289, 2002. 10.1142\/s0219265902000677","DOI":"10.1142\/S0219265902000677"},{"key":"27","doi-asserted-by":"publisher","unstructured":"[27] C.-H. Tsai, J.J.M. Tan, and L.-H. Hsu, \u201cThe super-connected property of recursive circulant graphs,\u201d Inf. Process. Lett., vo.91, no.6, pp.293-298, 2004. 10.1016\/j.ipl.2004.05.013","DOI":"10.1016\/j.ipl.2004.05.013"},{"key":"28","doi-asserted-by":"crossref","unstructured":"[28] J.-M. Xu, Topological Structure and Analysis of Interconnection Networks, Kluwer Academic Publishers, Dordrecht\/Boston\/London, 2001.","DOI":"10.1007\/978-1-4757-3387-7"},{"key":"29","doi-asserted-by":"publisher","unstructured":"[29] J.-M. Xu, M. Ma, \u201cSurvey on cycle and path embedding in some networks,\u201d Front. Math. China, vol.4, no.2, pp.217-252, 2009. 10.1007\/s11464-009-0017-5","DOI":"10.1007\/s11464-009-0017-5"},{"key":"30","doi-asserted-by":"crossref","unstructured":"[30] J.-S. Yang, J.-M. Chang, S.-M. Tang, and Y.-L. Wang, \u201cOn the independent spanning trees of recursive circulant graphs <i>G<\/i>(<i>cd<sup>m<\/sup><\/i>,<i>d<\/i>) with <i>d<\/i>&gt;2,\u201d Theor. Comput. Sci., vol.410, no.21-23, pp.2001-2010, 2009.","DOI":"10.1016\/j.tcs.2008.12.042"},{"key":"31","doi-asserted-by":"publisher","unstructured":"[31] J.-S. Yang, J.-M. Chang, S.-M. Tang, and Y.-L. Wang, \u201cConstructing multiple independent spanning trees on recursive circulant graphs <i>G<\/i>(2<i><sup>m<\/sup><\/i>,2),\u201d Int. J. Found. Comput. Sci., vol.21, no.1, pp.73-90, 2010. 10.1142\/s0129054110007143","DOI":"10.1142\/S0129054110007143"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E101.D\/12\/E101.D_2018PAP0009\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T12:40:30Z","timestamp":1573044030000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E101.D\/12\/E101.D_2018PAP0009\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,1]]},"references-count":31,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2018]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2018pap0009","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,12,1]]}}}