{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T12:19:10Z","timestamp":1763727550361,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,7,25]],"date-time":"2019-07-25T00:00:00Z","timestamp":1564012800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,7,25]],"date-time":"2019-07-25T00:00:00Z","timestamp":1564012800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11571096","11601176"],"award-info":[{"award-number":["11571096","11601176"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s10878-019-00441-x","type":"journal-article","created":{"date-parts":[[2019,7,25]],"date-time":"2019-07-25T11:02:58Z","timestamp":1564052578000},"page":"1143-1154","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Fractional matching preclusion of the restricted HL-graphs"],"prefix":"10.1007","volume":"38","author":[{"given":"Shunzhe","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Huiqing","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Dong","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2548-8810","authenticated-orcid":false,"given":"Xiaolan","family":"Hu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,25]]},"reference":[{"key":"441_CR1","doi-asserted-by":"publisher","first-page":"3048","DOI":"10.1016\/j.disc.2007.03.017","volume":"307","author":"REL Aldred","year":"2007","unstructured":"Aldred REL, Anstee RP, Locke SC (2007) Perfect matchings after vertex deletions. Discrete Math 307:3048\u20133054","journal-title":"Discrete Math"},{"key":"441_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph theory","author":"JA Bondy","year":"2008","unstructured":"Bondy JA, Murty USR (2008) Graph theory. Springer, Berlin"},{"key":"441_CR3","first-page":"185","volume":"174","author":"RC Brigham","year":"2005","unstructured":"Brigham RC, Harary F, Violin EC, Yellen J (2005) Perfect-matching preclusion. Congr Numer 174:185\u2013192","journal-title":"Congr Numer"},{"key":"441_CR4","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0020-0190(95)00054-G","volume":"55","author":"FB Chedid","year":"1995","unstructured":"Chedid FB (1995) On the generalized twisted cube. Inf Process Lett 55:49\u201352","journal-title":"Inf Process Lett"},{"key":"441_CR5","doi-asserted-by":"crossref","unstructured":"Cull P, Larson S (1991) The M\u00f6bius cubes. In: Proceedings of the 6th IEEE distributed memory computing conference, pp 699\u2013702","DOI":"10.1109\/DMCC.1991.633357"},{"key":"441_CR6","doi-asserted-by":"publisher","first-page":"1312","DOI":"10.1109\/12.102840","volume":"40","author":"K Efe","year":"1991","unstructured":"Efe K (1991) A variation on the hypercube with lower diameter. IEEE Trans Comput 40:1312\u20131316","journal-title":"IEEE Trans Comput"},{"key":"441_CR7","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1109\/71.159036","volume":"3","author":"K Efe","year":"1992","unstructured":"Efe K (1992) The crossed cube architecture for parallel computation. IEEE Trans Parallel Distrib Syst 3:513\u2013524","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"441_CR8","doi-asserted-by":"publisher","first-page":"6552","DOI":"10.1016\/j.disc.2007.11.032","volume":"308","author":"DR Guichard","year":"2008","unstructured":"Guichard DR (2008) Perfect matchings in pruned grid graphs. Discrete Math 308:6552\u20136557","journal-title":"Discrete Math"},{"key":"441_CR9","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/3-540-17943-7_126","volume-title":"The twisted cube, PARLE: parallel architectures and languages Europe vol 1: parallel architectures","author":"PAJ Hilbers","year":"1987","unstructured":"Hilbers PAJ, Koopman MRJ, van de Snepscheut JLA (1987) The twisted cube, PARLE: parallel architectures and languages Europe vol 1: parallel architectures. Springer, Berlin, pp 152\u2013159"},{"key":"441_CR10","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1080\/17445760.2011.650696","volume":"28","author":"WS Hong","year":"2013","unstructured":"Hong WS, Hsieh SY (2013) Extra edge connectivity of hypercube-like networks. Int J Parallel Emergent Distrib Syst 28:123\u2013133","journal-title":"Int J Parallel Emergent Distrib Syst"},{"key":"441_CR11","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1109\/TPDS.2008.123","volume":"20","author":"SY Hsieh","year":"2009","unstructured":"Hsieh SY, Lee CW (2009) Conditional edge-fault hamiltonicity of matching composition networks. IEEE Trans Parallel Distrib Syst 20:581\u2013592","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"441_CR12","doi-asserted-by":"publisher","first-page":"1064","DOI":"10.1109\/TC.2004.50","volume":"53","author":"PL Lai","year":"2004","unstructured":"Lai PL, Tan JJM, Tsai CH, Hsu LH (2004) The diagnosability of the matching composition network under the comparison diagnosis model. IEEE Trans Comput 53:1064\u20131069","journal-title":"IEEE Trans Comput"},{"key":"441_CR13","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1007\/s10878-016-0077-x","volume":"34","author":"Y Liu","year":"2017","unstructured":"Liu Y, Liu WW (2017) Fractional matching preclusion of graphs. J Comb Optim 34:522\u2013533","journal-title":"J Comb Optim"},{"key":"441_CR14","first-page":"60","volume":"35","author":"JH Park","year":"2008","unstructured":"Park JH (2008) Matching preclusion problem in restricted HL-graphs and recursive circulant $$G(2^m, 4)$$. J KIISE 35:60\u201365","journal-title":"J KIISE"},{"key":"441_CR15","doi-asserted-by":"publisher","first-page":"6409","DOI":"10.1016\/j.tcs.2011.08.008","volume":"412","author":"JH Park","year":"2011","unstructured":"Park JH, Ihm IS (2011) Strong matching preclusion. Theor Comput Sci 412:6409\u20136419","journal-title":"Theor Comput Sci"},{"key":"441_CR16","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1016\/j.dam.2012.10.002","volume":"161","author":"JH Park","year":"2013","unstructured":"Park JH, Ihm IS (2013) Strong matching preclusion under the conditional fault model. Discrete Appl Math 161:1093\u20131105","journal-title":"Discrete Appl Math"},{"key":"441_CR17","unstructured":"Park JH, Kim HC, Lim HS (2005) Fault-hamiltonicity of hypercube-like interconnection networks. In: Proceedings of IEEE international parallel and distributed processing symposium IPDPS 2005, Denver"},{"key":"441_CR18","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1109\/TC.2008.160","volume":"58","author":"JH Park","year":"2009","unstructured":"Park JH, Kim HC, Lim HS (2009) Many-to-many disjoint path covers in the presence of faulty elements. IEEE Trans Comput 58:528\u2013540","journal-title":"IEEE Trans Comput"},{"key":"441_CR19","doi-asserted-by":"publisher","first-page":"2632","DOI":"10.1016\/j.tcs.2009.02.041","volume":"410","author":"JH Park","year":"2009","unstructured":"Park JH, Son SH (2009) Conditional matching preclusion for hypercube-like interconnection networks. Theor Comput Sci 410:2632\u20132640","journal-title":"Theor Comput Sci"},{"key":"441_CR20","volume-title":"Fractional graph theory: a rational approach to the theory of graphs","author":"ER Scheinerman","year":"1997","unstructured":"Scheinerman ER, Ullman DH (1997) Fractional graph theory: a rational approach to the theory of graphs. Wiley, New York"},{"key":"441_CR21","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1080\/0020716042000301752","volume":"82","author":"X Yang","year":"2005","unstructured":"Yang X, Evans DJ, Megson GM (2005) The locally twisted cubes. Int J Comput Math 82:401\u2013413","journal-title":"Int J Comput Math"},{"key":"441_CR22","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/j.jcss.2017.04.002","volume":"88","author":"JX Zhou","year":"2017","unstructured":"Zhou JX (2017) On $$g$$-extra connectivity of hypercube-like networks. J Comput Syst Sci 88:208\u2013219","journal-title":"J Comput Syst Sci"},{"key":"441_CR23","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1002\/jgt.22096","volume":"85","author":"XD Zhu","year":"2017","unstructured":"Zhu XD (2017) A hypercube variant with small diameter. J Graph Theory 85:651\u2013660","journal-title":"J Graph Theory"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00441-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-019-00441-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00441-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,30]],"date-time":"2020-07-30T13:28:22Z","timestamp":1596115702000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-019-00441-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,25]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["441"],"URL":"https:\/\/doi.org\/10.1007\/s10878-019-00441-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2019,7,25]]},"assertion":[{"value":"25 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}