{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T10:40:23Z","timestamp":1721904023854},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"13","license":[{"start":{"date-parts":[[2024,5,24]],"date-time":"2024-05-24T00:00:00Z","timestamp":1716508800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,24]],"date-time":"2024-05-24T00:00:00Z","timestamp":1716508800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s11227-024-06206-6","type":"journal-article","created":{"date-parts":[[2024,5,24]],"date-time":"2024-05-24T17:02:08Z","timestamp":1716570128000},"page":"18942-18953","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fractional matchings on regular graphs"],"prefix":"10.1007","volume":"80","author":[{"given":"Xiaxia","family":"Guan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tianlong","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,24]]},"reference":[{"key":"6206_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph theory, GTM 244","author":"J Bondy","year":"2008","unstructured":"Bondy J, Murty USR (2008) Graph theory, GTM 244. Springer, Cham"},{"key":"6206_CR2","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":"6206_CR3","doi-asserted-by":"crossref","unstructured":"Broere I, Chartrand G, Oellermann O, Wall CE (1985) On the edge independence number of a regular graph with large edge connectivity. In: Combinatorial Mathematics: Proceedings of the 3rd International Conference, pp 94\u2013102","DOI":"10.1111\/j.1749-6632.1989.tb22440.x"},{"key":"6206_CR4","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1002\/net.20187","volume":"50","author":"E Cheng","year":"2007","unstructured":"Cheng E, Lipt\u00e1k L (2007) Matching preclusion for some interconnection. Networks 50:173\u2013180","journal-title":"Networks"},{"issue":"2","key":"6206_CR5","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1002\/net.10033","volume":"40","author":"SA Choudum","year":"2002","unstructured":"Choudum SA, Sunitha V (2002) Augmented cubes. Networks 40(2):71\u201384","journal-title":"Networks"},{"key":"6206_CR6","doi-asserted-by":"publisher","first-page":"2895","DOI":"10.1016\/j.disc.2013.08.030","volume":"313","author":"V Costa","year":"2013","unstructured":"Costa V, Dantas S, Rautenbach D (2013) Matchings in graphs of odd regularity and girth. Discret Math 313:2895\u20132902","journal-title":"Discret Math"},{"issue":"5","key":"6206_CR7","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0020-0190(92)90030-Y","volume":"42","author":"K Day","year":"1992","unstructured":"Day K, Tripathi A (1992) Arrangement graphs: a class of generalized star graphs. Inf Process Lett 42(5):235\u2013241","journal-title":"Inf Process Lett"},{"issue":"1","key":"6206_CR8","first-page":"84","volume":"26","author":"JX Fan","year":"2003","unstructured":"Fan JX, He LQ (2003) BC interconnection networks and their properties. Chin J Comput 26(1):84\u201390","journal-title":"Chin J Comput"},{"key":"6206_CR9","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1002\/jgt.3190110109","volume":"11","author":"P Katerinis","year":"1987","unstructured":"Katerinis P (1987) Maximum matching in a regular graph of specified connectivity and bounded order. J Graph Theory 11:53\u201358","journal-title":"J Graph Theory"},{"key":"6206_CR10","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":"6206_CR11","volume-title":"Matching theory, AMS Chelsea publishing series","author":"L Lov\u00e1sz","year":"2009","unstructured":"Lov\u00e1sz L, Plummer M (2009) Matching theory, AMS Chelsea publishing series, vol 367. North-Holland, Elsevier Science Publishers B.V., Amsterdam"},{"issue":"4","key":"6206_CR12","first-page":"6","volume":"21","author":"T Ma","year":"2019","unstructured":"Ma T, Mao Y, Cheng E, Melekian C (2019) Fractional matching preclusion for generalized augmented cubes. Discret Math Theor Comput Sci 21(4):6","journal-title":"Discret Math Theor Comput Sci"},{"key":"6206_CR13","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. Discret Appl Math 270:181\u2013189","journal-title":"Discret Appl Math"},{"key":"6206_CR14","first-page":"310","volume":"22","author":"J Plesn\u00edk","year":"1972","unstructured":"Plesn\u00edk J (1972) Connectivity of regular graphs and the existence of 1-factors. Matematick\u00fd \u010dasopis 22:310\u2013318","journal-title":"Matematick\u00fd \u010dasopis"},{"key":"6206_CR15","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1016\/j.ejc.2010.10.005","volume":"32","author":"O Suil","year":"2011","unstructured":"Suil O, West BD (2011) Matching and edge-connectivity in regular graphs. Eur J Combin 32:324\u2013329","journal-title":"Eur J Combin"},{"key":"6206_CR16","volume-title":"Fractional graph theory: a rational approach to the theory of graphs","author":"E Scheinerman","year":"1997","unstructured":"Scheinerman E, Ullman D (1997) Fractional graph theory: a rational approach to the theory of graphs. Wiley, New York"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06206-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-024-06206-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06206-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T10:15:30Z","timestamp":1721902530000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-024-06206-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,24]]},"references-count":16,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["6206"],"URL":"https:\/\/doi.org\/10.1007\/s11227-024-06206-6","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,24]]},"assertion":[{"value":"8 May 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 May 2024","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 declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}