{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:50:04Z","timestamp":1757314204443},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,5,7]],"date-time":"2015-05-07T00:00:00Z","timestamp":1430956800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s11786-015-0232-2","type":"journal-article","created":{"date-parts":[[2015,5,6]],"date-time":"2015-05-06T07:40:17Z","timestamp":1430898017000},"page":"253-263","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Embedding of Recursive Circulants into Certain Necklace Graphs"],"prefix":"10.1007","volume":"9","author":[{"given":"R. Sundara","family":"Rajan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Parthiban","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T. M.","family":"Rajalaxmi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,5,7]]},"reference":[{"issue":"14\u201315","key":"232_CR1","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/j.ipl.2010.04.007","volume":"110","author":"X. Yang","year":"2010","unstructured":"Yang X., Dong Q., Tan Y.Y.: Embedding meshes\/tori in faulty crossed cubes. Inf. Process Lett. 110(14\u201315), 559\u2013564 (2010)","journal-title":"Inf. Process Lett."},{"issue":"1\u20132","key":"232_CR2","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0304-3975(00)00176-6","volume":"244","author":"J.-H. Park","year":"2000","unstructured":"Park J.-H., Chwa K.-Y.: Fundamental study: recursive circulants and their embeddings among hypercubes. Theor. Comput. Sci. 244(1\u20132), 35\u201362 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"232_CR3","unstructured":"Park, J.-H., Chwa, K.-Y.: Recursive circulant: a new topology for multicomputer networks (extended abstract). In: Proceedings internationsl symposium parallel architectures, algorithms and networks ISPAN\u201994, Kanazawa, Japan, December, pp 73\u201380 (1994)"},{"issue":"1\u20132","key":"232_CR4","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0166-218X(95)00078-6","volume":"69","author":"H.-S. Lim","year":"1996","unstructured":"Lim H.-S., Park J.-H., Chwa K.-Y.: Embedding trees in recursive circulants. Discret. Appl. Math. 69(1\u20132), 83\u201399 (1996)","journal-title":"Discret. Appl. Math."},{"issue":"6","key":"232_CR5","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/j.ipl.2004.05.013","volume":"91","author":"C.-H. Tsai","year":"2004","unstructured":"Tsai C.-H., Tan J.J.M., Hsu L.-H.: The super-connected property of recursive circulant graphs. Inf. Process. Lett. 91(6), 293\u2013298 (2004)","journal-title":"Inf. Process. Lett."},{"issue":"3\u20134","key":"232_CR6","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1142\/S0219265902000677","volume":"3","author":"C.H. Tsai","year":"2002","unstructured":"Tsai C.H., Tan J.J.M., Chuang Y.C., Hsu L.H.: Hamiltonian properties of faulty recursive circulant graphs. J. Interconnect. Netw. 3(3\u20134), 273\u2013289 (2002)","journal-title":"J. Interconnect. Netw."},{"issue":"1\u20133","key":"232_CR7","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S0012-365X(99)00199-5","volume":"214","author":"D.K. Biss","year":"2000","unstructured":"Biss D.K.: Hamiltonian decomposition of recursive circulant graphs. Discret. Math. 214(1\u20133), 89\u201399 (2000)","journal-title":"Discret. Math."},{"key":"232_CR8","doi-asserted-by":"crossref","first-page":"3332","DOI":"10.1016\/j.ins.2006.01.001","volume":"176","author":"J. Fan","year":"2006","unstructured":"Fan J., Jia X., Lin X.: Complete path embeddings in crossed cubes. Inf. Sci. 176, 3332\u20133346 (2006)","journal-title":"Inf. Sci."},{"key":"232_CR9","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/S0166-218X(98)00098-5","volume":"87","author":"J.D. Chavez","year":"1998","unstructured":"Chavez J.D., Trapp R.: The cyclic cutwidth of trees. Discret. Appl. Math. 87, 25\u201332 (1998)","journal-title":"Discret. Appl. Math."},{"key":"232_CR10","unstructured":"Guu, C.-J.: The circular wirelength problem for hypercubes. Ph.D. dissertation, University of California, Riverside (1997)"},{"issue":"2","key":"232_CR11","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/j.amc.2008.10.040","volume":"207","author":"M.-C. Yang","year":"2009","unstructured":"Yang M.-C.: Path embedding in star graphs. Appl. Math. Comput. 207(2), 283\u2013291 (2009)","journal-title":"Appl. Math. Comput."},{"key":"232_CR12","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1002\/net.20027","volume":"44","author":"I. Rajasingh","year":"2004","unstructured":"Rajasingh I., Quadras J., Manuel P., William A.: Embedding of cycles and wheels into arbitrary trees. Networks 44, 173\u2013178 (2004)","journal-title":"Networks"},{"issue":"5","key":"232_CR13","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1016\/j.dam.2010.12.001","volume":"159","author":"P. Manuel","year":"2010","unstructured":"Manuel P.: Minimum average congestion of enhanced and augmented hypercube into complete binary tree. Discret. Appl. Math. 159(5), 360\u2013366 (2010)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"232_CR14","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/s10878-011-9443-x","volume":"26","author":"I. Rajasingh","year":"2013","unstructured":"Rajasingh I., Manuel P., Arockiaraj M., Rajan B.: Embeddings of circulant networks. J. Combinat. Optim. 26(1), 135\u2013151 (2013)","journal-title":"J. Combinat. Optim."},{"issue":"17","key":"232_CR15","doi-asserted-by":"crossref","first-page":"2109","DOI":"10.1016\/j.dam.2011.07.003","volume":"159","author":"P. Manuel","year":"2011","unstructured":"Manuel P., Arockiaraj M., Rajasingh I., Rajan B.: Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength. Discret. Appl. Math. 159(17), 2109\u20132116 (2011)","journal-title":"Discret. Appl. Math."},{"key":"232_CR16","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1016\/j.ipl.2011.06.011","volume":"111","author":"M. Arockiaraj","year":"2011","unstructured":"Arockiaraj M., Manuel P., Rajasingh I., Rajan B.: Wirelength of 1-fault hamiltonian graphs into wheels and fans. Inf. Process. Lett. 111, 921\u2013925 (2011)","journal-title":"Inf. Process. Lett."},{"key":"232_CR17","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/j.ipl.2012.03.006","volume":"112","author":"I. Rajasingh","year":"2012","unstructured":"Rajasingh I., Rajan B., Rajan R.S.: Embedding of hypercubes into necklace, windmill and snake graphs. Inf. Process. Lett. 112, 509\u2013515 (2012)","journal-title":"Inf. Process. Lett."},{"key":"232_CR18","unstructured":"Rajasingh, I., Rajan, R.S.: Exact wirelength of embedding circulant networks into necklace and windmill Graphs. Ars Combinatoria, (in press)"},{"key":"232_CR19","unstructured":"Rajan, R.S., Rajasingh, I., Manuel, P., Rajalaxmi, T.M.: Exact wirelength of embedding recursive circulants into certain trees. (communicated)"},{"key":"232_CR20","doi-asserted-by":"crossref","unstructured":"Bezrukov, S.L., Chavez, J.D., Harper, L.H., R\u00f6ttger, M., Schroeder, U.P.: Embedding of hypercubes into grids. MFCS, pp 693\u2013701 (1998)","DOI":"10.1007\/BFb0055820"},{"key":"232_CR21","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/S0012-365X(99)00162-4","volume":"213","author":"S.L. Bezrukov","year":"2000","unstructured":"Bezrukov S.L., Chavez J.D., Harper L.H., R\u00f6ttger M., Schroeder U.P.: The congestion of n-cube layout on a rectangular grid. Discret. Math. 213, 13\u201319 (2000)","journal-title":"Discret. Math."},{"issue":"7","key":"232_CR22","doi-asserted-by":"crossref","first-page":"1486","DOI":"10.1016\/j.dam.2008.09.013","volume":"157","author":"P. Manuel","year":"2009","unstructured":"Manuel P., Rajasingh I., Rajan B., Mercy H.: Exact wirelength of hypercube on a grid. Discret. Appl. Math. 157(7), 1486\u20131495 (2009)","journal-title":"Discret. Appl. Math."},{"key":"232_CR23","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s000260050003","volume":"4","author":"S.L. Bezrukov","year":"2000","unstructured":"Bezrukov S.L., Das S.K., Els\u00e4sser R.: An edge-isoperimetric problem for powers of the Petersen graph. Ann. Comb. 4, 153\u2013169 (2000)","journal-title":"Ann. Comb."},{"key":"232_CR24","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability. A Guide to the theory of NP-Completeness, Freeman, San Francisco (1979)"},{"key":"232_CR25","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511616679","volume-title":"Global Methods for Combinatorial Isoperimetric Problems","author":"L.H. Harper","year":"2004","unstructured":"Harper L.H.: Global Methods for Combinatorial Isoperimetric Problems. Cambridge University Press, Cambridge (2004)"},{"issue":"1","key":"232_CR26","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1006\/jpdc.1995.1002","volume":"24","author":"J.C. Bermond","year":"1995","unstructured":"Bermond J.C., Comellas F., Hsu D.F.: Distributed loop computer networks. A survey. J. Parallel Distrib. Comput. 24(1), 2\u201310 (1995)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"15","key":"232_CR27","doi-asserted-by":"crossref","first-page":"1970","DOI":"10.1080\/00207160.2012.697557","volume":"89","author":"I. Rajasingh","year":"2012","unstructured":"Rajasingh I., Rajan B., Rajan R.S.: Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs. Int. J. Computer Math. 89(15), 1970\u20131978 (2012)","journal-title":"Int. J. Computer Math."}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-015-0232-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-015-0232-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-015-0232-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T18:35:11Z","timestamp":1559414111000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-015-0232-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,7]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["232"],"URL":"https:\/\/doi.org\/10.1007\/s11786-015-0232-2","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,7]]}}}