{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T04:53:24Z","timestamp":1776401604643,"version":"3.51.2"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,11,14]],"date-time":"2019-11-14T00:00:00Z","timestamp":1573689600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,14]],"date-time":"2019-11-14T00:00:00Z","timestamp":1573689600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1007\/s00373-019-02118-y","type":"journal-article","created":{"date-parts":[[2019,11,14]],"date-time":"2019-11-14T16:02:44Z","timestamp":1573747364000},"page":"93-108","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Matching Extendability and Connectivity of Regular Graphs from Eigenvalues"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9312-4453","authenticated-orcid":false,"given":"Wenqian","family":"Zhang","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,14]]},"reference":[{"key":"2118_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0095-8956(71)90041-4","volume":"10","author":"I Anderson","year":"1971","unstructured":"Anderson, I.: Perfect matchings of a graph. J. Combinatorial Theory 10, 183\u2013186 (1971)","journal-title":"J. Combinatorial Theory"},{"key":"2118_CR2","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.laa.2004.08.014","volume":"395","author":"A Brouwer","year":"2005","unstructured":"Brouwer, A., Haemers, W.: Eigenvalues and perfect matchings. Linear Algebra Appl. 395, 155\u2013162 (2005)","journal-title":"Linear Algebra Appl."},{"key":"2118_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-1939-6","volume-title":"Spectra of Graphs","author":"A Brouwer","year":"2012","unstructured":"Brouwer, A., Haemers, W.: Spectra of Graphs. Springer, New York (2012)"},{"key":"2118_CR4","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1016\/j.laa.2009.08.029","volume":"432","author":"SM Cioab\u01ce","year":"2010","unstructured":"Cioab\u01ce, S.M.: Eigenvalues and edge-connectivity of regular graphs. Linear Algebra Appl. 432, 458\u2013470 (2010)","journal-title":"Linear Algebra Appl."},{"key":"2118_CR5","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/j.jctb.2008.06.008","volume":"99","author":"SM Cioab\u01ce","year":"2009","unstructured":"Cioab\u01ce, S.M., Gregory, D., Haemers, W.: Matchings in regular graphs from eigenvalues. J. Combinatorial Theory, Ser. B 99, 287\u2013297 (2009)","journal-title":"J. Combinatorial Theory, Ser. B"},{"key":"2118_CR6","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/j.ejc.2017.01.001","volume":"62","author":"SM Cioab\u01ce","year":"2017","unstructured":"Cioab\u01ce, S.M., Koolen, J.H., Li, W.: Max-cut and extendability of matchings in distance-regular graphs. Eur. J. Combinatorics 62, 232\u2013244 (2017)","journal-title":"Eur. J. Combinatorics"},{"issue":"2","key":"2118_CR7","doi-asserted-by":"crossref","first-page":"23","DOI":"10.37236\/3767","volume":"21","author":"SM Cioab\u01ce","year":"2014","unstructured":"Cioab\u01ce, S.M., Li, W.: The extendability of matchings in strongly regular graphs. Electr. J. Combinatorics 21(2), 23 (2014)","journal-title":"Electr. J. Combinatorics"},{"key":"2118_CR8","doi-asserted-by":"publisher","first-page":"2781","DOI":"10.1016\/j.laa.2008.06.016","volume":"429","author":"J Ebrahimi","year":"2008","unstructured":"Ebrahimi, J., Mohar, B., Nikiforov, V., Ahmady, A.: On the sum of two largest eigenvalues of a symmetric matrix. Linear Algebra Appl. 429, 2781\u20132787 (2008)","journal-title":"Linear Algebra Appl."},{"key":"2118_CR9","doi-asserted-by":"crossref","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","volume":"23","author":"M Fiedler","year":"1973","unstructured":"Fiedler, M.: Algebraic connectivity of graphs. Czechoslovak Math. J. 23, 298\u2013305 (1973)","journal-title":"Czechoslovak Math. J."},{"key":"2118_CR10","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1016\/0024-3795(95)00199-2","volume":"226","author":"W Haemers","year":"1995","unstructured":"Haemers, W.: Interlacing eigenvalues and graphs. Linear Algebra Appl. 226, 593\u2013616 (1995)","journal-title":"Linear Algebra Appl."},{"key":"2118_CR11","first-page":"187","volume":"6","author":"DA Holton","year":"1992","unstructured":"Holton, D.A., Lou, D.J.: Matching extensions of strongly regular graphs. Aust. J. Combinatorics 6, 187\u2013208 (1992)","journal-title":"Aust. J. Combinatorics"},{"key":"2118_CR12","unstructured":"Lov\u00e1sz, L., Plummer, M.: Matching Theory, Ann. Discrete Math (1986)"},{"key":"2118_CR13","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BF01889914","volume":"23","author":"L Lov\u00e1sz","year":"1972","unstructured":"Lov\u00e1sz, L.: On the structure of factorizable graphs. Acta Mathematica Academiae Scientiarum Hungaricae 23, 179\u2013195 (1972)","journal-title":"Acta Mathematica Academiae Scientiarum Hungaricae"},{"key":"2118_CR14","first-page":"160","volume":"30","author":"L Lov\u00e1sz","year":"1974","unstructured":"Lov\u00e1sz, L., Plummer, M.: On a family of planar bicritical graphs. Proc. Lond. Math. Soc. 30, 160\u2013176 (1974)","journal-title":"Proc. Lond. Math. Soc."},{"key":"2118_CR15","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/j.jctb.2008.07.001","volume":"99","author":"B Mohar","year":"2009","unstructured":"Mohar, B.: On the sum of $$k$$ largest eigenvalues of graphs and symmetric matrices. J. Combinatorial Theory Ser. B 99, 306\u2013313 (2009)","journal-title":"J. Combinatorial Theory Ser. B"},{"key":"2118_CR16","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1112\/jlms\/s1-22.2.107","volume":"2","author":"W Tutte","year":"1947","unstructured":"Tutte, W.: The factorization of linear graphs. J. Lond. Math. Soc. 2, 107\u2013111 (1947)","journal-title":"J. Lond. Math. Soc."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02118-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-019-02118-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02118-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,13]],"date-time":"2020-11-13T01:06:35Z","timestamp":1605229595000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-019-02118-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,14]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["2118"],"URL":"https:\/\/doi.org\/10.1007\/s00373-019-02118-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,14]]},"assertion":[{"value":"4 October 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 October 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 November 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}