{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T14:52:54Z","timestamp":1676904774836},"reference-count":11,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Inter. Net."],"published-print":{"date-parts":[[2005,12]]},"abstract":"<jats:p> Suppose that G = (V<jats:sub>0<\/jats:sub> \u222a V<jats:sub>1<\/jats:sub>, E) is a bipartite graph with two partite sets V<jats:sub>0<\/jats:sub> and V<jats:sub>1<\/jats:sub> of equal size. Let x and y be two arbitrary distinct, vertices and let w be another vertex different from x and y. G is said to be 1-vertex-Hamiltonian-laceable if G - w satisfies the following three properties: <\/jats:p><jats:p> P1. There is a (|V<jats:sub>0<\/jats:sub>| + |V<jats:sub>1<\/jats:sub>| - 2)-length path between x and y, where x and y are in the same partite set and w is in the other partite set; <\/jats:p><jats:p> P2. There is a (|V<jats:sub>0<\/jats:sub>| + |V<jats:sub>1<\/jats:sub>| - 3)-length path between x and y, where x and y are in different partite sets and w is in any partite set; <\/jats:p><jats:p> P3. There is a (|V<jats:sub>0<\/jats:sub>| + |V<jats:sub>1<\/jats:sub>| - 4)-length path between x and y, where x, y, w are in the same partite set. <\/jats:p><jats:p> Let F<jats:sub>e<\/jats:sub> be the set of faulty edges of an n-dimensional hypercube Q<jats:sub>n<\/jats:sub>. In this paper, we show that Q<jats:sub>n<\/jats:sub> - F<jats:sub>e<\/jats:sub> (the graph obtained by deleting all edges of F<jats:sub>e<\/jats:sub> from Q<jats:sub>n<\/jats:sub>) remains 1-vertex-Hamiltonian-laceable when |F<jats:sub>e<\/jats:sub>| \u2264 n - 3. <\/jats:p>","DOI":"10.1142\/s0219265905001496","type":"journal-article","created":{"date-parts":[[2006,1,6]],"date-time":"2006-01-06T06:44:29Z","timestamp":1136529869000},"page":"407-415","source":"Crossref","is-referenced-by-count":2,"title":["1-Vertex-Hamiltonian-Laceability of Hypercubes with Maximal Edge Faults"],"prefix":"10.1142","volume":"06","author":[{"given":"Sun-Yuan","family":"Hsieh","sequence":"first","affiliation":[{"name":"Department of Computer Science and Information Engineering, National Cheng Kung University, No. 1, University Road, Tainan 701, Taiwan, ROC"}]},{"given":"Che-Nan","family":"Kuo","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Information Engineering, National Cheng Kung University, No. 1, University Road, Tainan 701, Taiwan, ROC"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf1","volume-title":"Parallel Computation: Models and Methods","author":"Akl S. G.","year":"1997"},{"key":"rf2","volume":"37","author":"Bermond J. C.","journal-title":"Discrete Applied Mathematics"},{"key":"rf3","first-page":"323","volume":"33","author":"Bhuyan L.","journal-title":"IEEE Transactions on Computers"},{"key":"rf4","volume":"23","author":"Hsu D. F.","journal-title":"Networks"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1002\/1097-0037(200012)36:4<225::AID-NET3>3.0.CO;2-G"},{"key":"rf6","volume-title":"Introduction to Parallel Algorithms and Architecture: Arrays \u00b7 Trees \u00b7 Hypercubes","author":"Leighton F. T.","year":"1992"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/S0898-1221(97)00223-X"},{"key":"rf9","first-page":"103","volume":"21","author":"Simmons G.","journal-title":"Congressus Numerantium"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(02)00214-4"},{"key":"rf11","volume-title":"Introduction to Graph Theory","author":"West D. B.","year":"2001"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3387-7"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219265905001496","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T23:32:40Z","timestamp":1565134360000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219265905001496"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,12]]},"references-count":11,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2005,12]]}},"alternative-id":["10.1142\/S0219265905001496"],"URL":"https:\/\/doi.org\/10.1142\/s0219265905001496","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"value":"0219-2659","type":"print"},{"value":"1793-6713","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,12]]}}}