{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:48Z","timestamp":1740122388047,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,7,27]],"date-time":"2022-07-27T00:00:00Z","timestamp":1658880000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,7,27]],"date-time":"2022-07-27T00:00:00Z","timestamp":1658880000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11771247","11971158"],"award-info":[{"award-number":["11771247","11971158"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11901048","12071002"],"award-info":[{"award-number":["11901048","12071002"]}],"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":[[2022,9]]},"DOI":"10.1007\/s10878-022-00888-5","type":"journal-article","created":{"date-parts":[[2022,7,27]],"date-time":"2022-07-27T21:03:55Z","timestamp":1658955835000},"page":"1323-1329","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The fractional matching preclusion number of complete n-balanced k-partite graphs"],"prefix":"10.1007","volume":"44","author":[{"given":"Yu","family":"Luan","sequence":"first","affiliation":[]},{"given":"Mei","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Yi","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,27]]},"reference":[{"key":"888_CR1","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":"888_CR2","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF03353011","volume":"13","author":"G Chen","year":"1997","unstructured":"Chen G, Jacobson MS (1997) Degree Sum conditions for Hamiltonicity on k-Partite Graphs. Graphs Comb. 13:325\u2013343","journal-title":"Graphs Comb."},{"key":"888_CR3","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.tcs.2015.01.046","volume":"576","author":"E Cheng","year":"2015","unstructured":"Cheng E, Connolly R, Melekian C (2015) Matching preclusion and conditional matching preclusion problems for the folded Petersen cube. Theor. Comput. Sci. 576:30\u201344","journal-title":"Theor. Comput. Sci."},{"key":"888_CR4","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1002\/net.20440","volume":"59","author":"E Cheng","year":"2012","unstructured":"Cheng E, Hu P, Jia R, Lipt\u00e1k L (2012) Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions. Networks 59:349\u2013356","journal-title":"Networks"},{"key":"888_CR5","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1002\/net.20441","volume":"59","author":"E Cheng","year":"2012","unstructured":"Cheng E, Hu P, Jia R, Lipt\u00e1k L (2012) Matching preclusion and conditional matching preclusion problems for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyperstars. Networks 59:357\u2013364","journal-title":"Networks"},{"key":"888_CR6","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1080\/17445760.2013.847441","volume":"29","author":"E Cheng","year":"2014","unstructured":"Cheng E, Hu P, Jia R, Lipt\u00e1k L, Scholten B, Voss J (2014) Matching preclusion and conditional matching preclusion for pancake and burnt pancake graphs. Int. J. Parallel Emerg. Distrib. Syst. 29:499\u2013512","journal-title":"Int. J. Parallel Emerg. Distrib. Syst."},{"key":"888_CR7","doi-asserted-by":"publisher","first-page":"1936","DOI":"10.1016\/j.dam.2012.03.040","volume":"160","author":"E Cheng","year":"2012","unstructured":"Cheng E, Lipman MJ, Lipt\u00e1k L (2012) Matching preclusion and conditional matching preclusion for regular interconnection networks. Discrete Appl. Math. 160:1936\u20131954","journal-title":"Discrete Appl. Math."},{"key":"888_CR8","doi-asserted-by":"publisher","first-page":"1699","DOI":"10.1016\/j.dam.2012.03.014","volume":"160","author":"E Cheng","year":"2012","unstructured":"Cheng E, Lipt\u00e1k L (2012) Matching preclusion and conditional matching preclusion problems for tori and related Cartersian products. Discrete Appl. Math. 160:1699\u20131716","journal-title":"Discrete Appl. Math."},{"key":"888_CR9","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.dam.2016.02.001","volume":"207","author":"Q Li","year":"2016","unstructured":"Li Q, He J, Zhang H (2016) Matching preclusion for vertex-transitive networks. Discrete Appl. Math. 207:90\u201398","journal-title":"Discrete Appl. Math."},{"issue":"191","key":"888_CR10","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.dam.2015.04.001","volume":"190","author":"Q Li","year":"2015","unstructured":"Li Q, Shiu WC, Yao H (2015) Matching preclusion for cube-connected cycles. Discrete Appl Math. 190(191):118\u2013126","journal-title":"Discrete Appl Math."},{"key":"888_CR11","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1080\/23799927.2016.1249412","volume":"1","author":"R Lin","year":"2016","unstructured":"Lin R, Zhang H (2016) Maximally matched and super matched regular graphs. Int. J. Comput. Math. Comput. Syst. Theory 1:74\u201384","journal-title":"Int. J. Comput. Math. Comput. Syst. Theory"},{"key":"888_CR12","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.dam.2017.07.039","volume":"233","author":"R Lin","year":"2017","unstructured":"Lin R, Zhang H (2017) Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs. Discrete Appl. Math. 233:104\u2013117","journal-title":"Discrete Appl. Math."},{"key":"888_CR13","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.dam.2019.08.016","volume":"277","author":"R Lin","year":"2019","unstructured":"Lin R, Zhang H, Zhao W (2019) Matching preclusion for direct product of regular graphs. Discrete Appl. Math. 277:221\u2013230","journal-title":"Discrete Appl. Math."},{"key":"888_CR14","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 W (2017) Fractional matching preclusion of graphs. J. Comb. Optim. 34:522\u2013533","journal-title":"J. Comb. Optim."},{"key":"888_CR15","first-page":"109","volume":"84","author":"H Lv","year":"2012","unstructured":"Lv H, Li X, Zhang H (2012) Matching preclusion for balanced hypercubes. Theor. Comput. Sci. 84:109\u2013136","journal-title":"Theor. Comput. Sci."},{"key":"888_CR16","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.dam.2019.07.014","volume":"270","author":"T Ma","year":"2019","unstructured":"Ma T, Mao Y, Cheng E, Wang J (2019) Fractional matching preclusion for arrangement graphs. Discrete Appl. Math. 270:181\u2013189","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"888_CR17","doi-asserted-by":"publisher","first-page":"1850017","DOI":"10.1142\/S0129626418500172","volume":"28","author":"T Ma","year":"2018","unstructured":"Ma T, Mao Y, Cheng E, Wang J (2018) Fractional matching preclusion for $$(n, k)$$-star graphs. Parallel Process. Lett. 28(4):1850017","journal-title":"Parallel Process. Lett."},{"key":"888_CR18","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.tcs.2020.09.021","volume":"846","author":"J Wang","year":"2020","unstructured":"Wang J (2020) Fractional matching preclusion of product networks. Theor. Comput. Sci. 846:75\u201381","journal-title":"Theor. Comput. Sci."},{"key":"888_CR19","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.tcs.2018.06.050","volume":"755","author":"Z Wang","year":"2019","unstructured":"Wang Z, Melekian C, Cheng E, Mao Y (2019) Matching preclusion number in product graphs. Theor. Comput. Sci. 755:38\u201347","journal-title":"Theor. Comput. Sci."},{"key":"888_CR20","doi-asserted-by":"publisher","first-page":"2066","DOI":"10.1016\/j.dam.2010.08.017","volume":"158","author":"S Wang","year":"2010","unstructured":"Wang S, Wang R, Lin S, Li J (2010) Matching preclusion for $$k$$-ary $$n$$-cubes. Discrete Appl. Math. 158:2066\u20132070","journal-title":"Discrete Appl. Math."},{"key":"888_CR21","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1007\/s10878-019-00441-x","volume":"38","author":"S Zhang","year":"2019","unstructured":"Zhang S, Liu H, Li D, Hu X (2019) Fractional matching preclusion of the restricted HL-graphs. J. Comb. Optim. 38:1143\u20131154","journal-title":"J. Comb. Optim."}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00888-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-022-00888-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00888-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T06:20:38Z","timestamp":1660371638000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-022-00888-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,27]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["888"],"URL":"https:\/\/doi.org\/10.1007\/s10878-022-00888-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2022,7,27]]},"assertion":[{"value":"11 July 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}