{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:57:56Z","timestamp":1760245076825},"reference-count":7,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1016\/s0020-0190(02)00509-4","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T17:32:55Z","timestamp":1053365575000},"page":"263-269","source":"Crossref","is-referenced-by-count":5,"title":["Brother trees: A family of optimal 1p-hamiltonian and 1-edge hamiltonian graphs"],"prefix":"10.1016","volume":"86","author":[{"given":"Shin-Shin","family":"Kao","sequence":"first","affiliation":[]},{"given":"Lih-Hsing","family":"Hsu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(02)00509-4_BIB001","series-title":"Graph Theory","author":"Harary","year":"1972"},{"key":"10.1016\/S0020-0190(02)00509-4_BIB002","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0020-0190(99)00122-2","article-title":"Christmas tree: A versatile 1-fault tolerant design for token rings","volume":"72","author":"Hung","year":"1999","journal-title":"Inform. Process. Lett."},{"issue":"5","key":"10.1016\/S0020-0190(02)00509-4_BIB003","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S0020-0190(02)00310-1","article-title":"Ring embedding in faulty honeycomb rectangular torus","volume":"84","author":"Cho","year":"2002","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(02)00509-4_BIB004","series-title":"Introduction to Parallel Algorithms and Architectures: Arrays \u00b7 Trees \u00b7 Hypercubes","author":"Leighton","year":"1992"},{"key":"10.1016\/S0020-0190(02)00509-4_BIB005","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0020-0190(92)90192-X","article-title":"Hamiltonian graphs with minimum number of edges for fault-tolerant topologies","volume":"44","author":"Mukhopadhyaya","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(02)00509-4_BIB006","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0020-0190(96)00114-7","article-title":"Embedding a ring in a hypercube with both faulty links and faulty nodes","volume":"59","author":"Tseng","year":"1996","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(02)00509-4_BIB007","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/S0020-0190(98)00004-0","article-title":"Optimal 1-hamiltonian graphs","volume":"65","author":"Wang","year":"1998","journal-title":"Inform. Process. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002005094?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002005094?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T23:50:08Z","timestamp":1553385008000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019002005094"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":7,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S0020019002005094"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(02)00509-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}