{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T10:45:05Z","timestamp":1743849905338,"version":"3.37.3"},"reference-count":28,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,6,15]],"date-time":"2023-06-15T00:00:00Z","timestamp":1686787200000},"content-version":"vor","delay-in-days":1475,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"name":"Tianyuan Fund of National Natural Science Foundation of China","award":["11626114"]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11701218"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003453","name":"Natural Science Foundation of Guangdong Province, China","doi-asserted-by":"publisher","award":["2016A030310082"],"id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1016\/j.dam.2019.02.033","type":"journal-article","created":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T15:26:37Z","timestamp":1552577197000},"page":"56-71","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":12,"special_numbering":"C","title":["Hamiltonian paths and cycles pass through prescribed edges in the balanced hypercubes"],"prefix":"10.1016","volume":"262","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9933-6601","authenticated-orcid":false,"given":"Dongqin","family":"Cheng","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2019.02.033_b1","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.ipl.2007.06.014","article-title":"Cycles passing through prescribed edges in a hypercube with some faulty edges","volume":"104","author":"Chen","year":"2007","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.dam.2019.02.033_b2","first-page":"9885","article-title":"A lower bound on the number of Hamiltonian cycles through a prescribed edge in a crossed cube","volume":"219","author":"Chen","year":"2013","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.dam.2019.02.033_b3","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.ipl.2017.01.006","article-title":"A note on path embedding in crossed cubes with faulty vertices","volume":"121","author":"Chen","year":"2017","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.dam.2019.02.033_b4","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/j.ins.2014.11.008","article-title":"Various cycles embedding in faulty balanced hypercubes","volume":"297","author":"Cheng","year":"2015","journal-title":"Inform. Sci."},{"key":"10.1016\/j.dam.2019.02.033_b5","first-page":"127","article-title":"Two node-disjoint paths in balanced hypercubes","volume":"242","author":"Cheng","year":"2014","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.dam.2019.02.033_b6","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/j.ins.2014.08.003","article-title":"Vertex-fault-tolerant cycles embedding in balanced hypercubes","volume":"288","author":"Cheng","year":"2014","journal-title":"Inform. Sci."},{"key":"10.1016\/j.dam.2019.02.033_b7","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1016\/j.dam.2015.11.014","article-title":"A strong connectivity property of the generalized exchanged hypercube","volume":"216","author":"Cheng","year":"2017","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"10.1016\/j.dam.2019.02.033_b8","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1109\/71.755822","article-title":"Fault-free Hamiltonian cycles in faulty arrangement graphs","volume":"10","author":"Hsieh","year":"1999","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"9","key":"10.1016\/j.dam.2019.02.033_b9","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1109\/12.954510","article-title":"Longest fault-free paths in star graphs with edge faults","volume":"50","author":"Hsieh","year":"2001","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.dam.2019.02.033_b10","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1016\/j.tcs.2008.12.025","article-title":"Constructing edge-disjoint spanning trees in locally twisted cubes","volume":"410","author":"Hsieh","year":"2009","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10.1016\/j.dam.2019.02.033_b11","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1002\/1097-0037(200012)36:4<225::AID-NET3>3.0.CO;2-G","article-title":"Hamiltonian-laceability of satr graphs","volume":"36","author":"Hsien","year":"2000","journal-title":"Networks"},{"issue":"4","key":"10.1016\/j.dam.2019.02.033_b12","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1142\/S0129156495000237","article-title":"Area efficient layout of balanced hypercubes","volume":"6","author":"Huang","year":"1995","journal-title":"Int. J. High Speed Electron. Syst."},{"key":"10.1016\/j.dam.2019.02.033_b13","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.dam.2016.12.008","article-title":"Cycles embedding in folded hypercubes with conditional faulty vertices","volume":"220","author":"Kuo","year":"2017","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2019.02.033_b14","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.jpdc.2016.12.002","article-title":"Optimal construction of node-disjoint shortest paths in folded hypercubes","volume":"102","author":"Lai","year":"2017","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/j.dam.2019.02.033_b15","first-page":"180","article-title":"Edge-fault-tolerant edge-bipancyclicity of balanced hypercubes","volume":"307","author":"Li","year":"2017","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.dam.2019.02.033_b16","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/j.tcs.2012.09.020","article-title":"Matching preclusion for balanced hypercubes","volume":"465","author":"L\u00fc","year":"2012","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/j.dam.2019.02.033_b17","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/s11227-013-1040-6","article-title":"Hyper-Hamiltonian laceability of balanced hypercubes","volume":"68","author":"L\u00fc","year":"2014","journal-title":"J. Supercomput."},{"key":"10.1016\/j.dam.2019.02.033_b18","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/j.ipl.2008.02.016","article-title":"A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges","volume":"107","author":"Wang","year":"2008","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.dam.2019.02.033_b19","doi-asserted-by":"crossref","first-page":"3054","DOI":"10.1016\/j.ins.2011.03.011","article-title":"Hamiltonian paths and cycles with prescribed edges in the 3-ary n-cube","volume":"181","author":"Wang","year":"2011","journal-title":"Inform. Sci."},{"key":"10.1016\/j.dam.2019.02.033_b20","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.tcs.2017.01.016","article-title":"Edge-independent spanning trees in augmented cubes","volume":"670","author":"Wang","year":"2017","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.dam.2019.02.033_b21","doi-asserted-by":"crossref","first-page":"1425","DOI":"10.1016\/j.dam.2011.05.008","article-title":"Hamiltonian cycles passing through linear forests in k-ary n-cubes","volume":"159","author":"Wang","year":"2011","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"10.1016\/j.dam.2019.02.033_b22","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1109\/12.588063","article-title":"The balanced hypercubes: A cube-based system for fault-tolerant applications","volume":"46","author":"Wu","year":"1997","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.dam.2019.02.033_b23","first-page":"1393","article-title":"Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes","volume":"189","author":"Xu","year":"2007","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.dam.2019.02.033_b24","first-page":"970","article-title":"Super connectivity of balanced hypercubes","volume":"219","author":"Yang","year":"2012","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.dam.2019.02.033_b25","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.ipl.2017.05.001","article-title":"Strong Menger connectivity with conditional faults of folded hypercubes","volume":"125","author":"Yang","year":"2017","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"10.1016\/j.dam.2019.02.033_b26","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1109\/TPDS.2014.2311794","article-title":"Fault-free Hamiltonian cycles passing through prescribed edges in k-ary n-cubes with faulty edges","volume":"26","author":"Zhang","year":"2015","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10.1016\/j.dam.2019.02.033_b27","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.ins.2014.12.026","article-title":"Fault-tolerant Hamiltonian laceability of balanced hypercubes","volume":"300","author":"Zhou","year":"2015","journal-title":"Inform. Sci."},{"issue":"3","key":"10.1016\/j.dam.2019.02.033_b28","doi-asserted-by":"crossref","first-page":"876","DOI":"10.1109\/TC.2014.2304391","article-title":"Symmetric property and reliability of balanced hypercube","volume":"64","author":"Zhou","year":"2015","journal-title":"IEEE Trans. Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X1930126X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X1930126X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T23:39:27Z","timestamp":1712360367000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X1930126X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":28,"alternative-id":["S0166218X1930126X"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2019.02.033","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[2019,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Hamiltonian paths and cycles pass through prescribed edges in the balanced hypercubes","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2019.02.033","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}