{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:14:14Z","timestamp":1757618054364,"version":"3.44.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,5,12]],"date-time":"2025-05-12T00:00:00Z","timestamp":1747008000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,12]],"date-time":"2025-05-12T00:00:00Z","timestamp":1747008000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["12171154"],"award-info":[{"award-number":["12171154"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s40314-025-03227-6","type":"journal-article","created":{"date-parts":[[2025,5,12]],"date-time":"2025-05-12T02:44:35Z","timestamp":1747017875000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The algebraic connectivity of graphs with given induced matching number"],"prefix":"10.1007","volume":"44","author":[{"given":"Ji-Ming","family":"Guo","sequence":"first","affiliation":[]},{"given":"Li-Ting","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Zhiwen","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,12]]},"reference":[{"key":"3227_CR1","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1016\/j.laa.2008.09.030","volume":"430","author":"T Biyiko\u01e7lu","year":"2009","unstructured":"Biyiko\u01e7lu T, Leydold J (2009) Algebraic connectivity and degree sequences of trees. Linear Algebra Appl 430:811\u2013817","journal-title":"Linear Algebra Appl"},{"key":"3227_CR2","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0166-218X(92)90275-F","volume":"24","author":"K Cameron","year":"1989","unstructured":"Cameron K (1989) Induced matchings. Discrete Appl Math 24:97\u2013102","journal-title":"Discrete Appl Math"},{"key":"3227_CR3","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/S1571-0653(05)80122-2","volume":"5","author":"K Cameron","year":"2000","unstructured":"Cameron K (2000) Induced matchings in intersection graphs. Electron Notes Discrete Math 5:50\u201352","journal-title":"Electron Notes Discrete Math"},{"key":"3227_CR4","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0012-365X(02)00803-8","volume":"266","author":"K Cameron","year":"2003","unstructured":"Cameron K, Sritharan R, Tang Y (2003) Finding a maximum induced matching in weakly chordal graphs. Discrete Math 266:133\u2013142","journal-title":"Discrete Math"},{"key":"3227_CR5","volume-title":"Spectra of graphs","author":"D Cvetkovi\u0107","year":"1995","unstructured":"Cvetkovi\u0107 D, Doob M, Sachs H (1995) Spectra of graphs, 3rd edn. Johann Abrosius Barth Verlag","edition":"3"},{"key":"3227_CR6","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.laa.2006.08.017","volume":"423","author":"NMM de Abreu","year":"2007","unstructured":"de Abreu NMM (2007) Old and new results on algebraic connectivity of graphs. Linear Algebra Appl 423:53\u201373","journal-title":"Linear Algebra Appl"},{"key":"3227_CR7","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0012-365X(01)00355-7","volume":"254","author":"SM Fallat","year":"2002","unstructured":"Fallat SM, Kirkland S, Pati S (2002) Minimizing algebraic connectivity over connected graphs with fixed girth. Discrete Math 254:115\u2013142","journal-title":"Discrete Math"},{"key":"3227_CR8","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1080\/0308108031000069182","volume":"51","author":"SM Fallat","year":"2003","unstructured":"Fallat SM, Kirkland S, Pati S (2003) Maximizing algebraic connectivity over unicyclic graphs. Linear Multilinear Algebra 51:221\u2013241","journal-title":"Linear Multilinear Algebra"},{"issue":"2","key":"3227_CR9","doi-asserted-by":"publisher","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","volume":"23","author":"M Fiedler","year":"1973","unstructured":"Fiedler M (1973) Algebraic connectivity of graphs. Czech Math J 23(2):298\u2013305","journal-title":"Czech Math J"},{"key":"3227_CR10","doi-asserted-by":"publisher","first-page":"619","DOI":"10.21136\/CMJ.1975.101357","volume":"25","author":"M Fiedler","year":"1975","unstructured":"Fiedler M (1975) A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czech Math J 25:619\u2013633","journal-title":"Czech Math J"},{"issue":"25","key":"3227_CR11","doi-asserted-by":"publisher","first-page":"57","DOI":"10.4064\/-25-1-57-70","volume":"1","author":"M Fiedler","year":"1989","unstructured":"Fiedler M (1989) Laplacian of graphs and algebraic connectivity. Banach Center Publ 1(25):57\u201370","journal-title":"Banach Center Publ"},{"key":"3227_CR12","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0166-218X(99)00194-8","volume":"101","author":"MC Golumbic","year":"2000","unstructured":"Golumbic MC, Lewenstein M (2000) New results on induced matchings. Discrete Appl Math 101:157\u2013165","journal-title":"Discrete Appl Math"},{"key":"3227_CR13","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1137\/S0895480191222653","volume":"7","author":"R Grone","year":"1994","unstructured":"Grone R, Merris R (1994) The Laplacian spectrum of a graph. SIAM J Discrete Math 7:221\u2013229","journal-title":"SIAM J Discrete Math"},{"key":"3227_CR14","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1137\/0611016","volume":"11","author":"R Grone","year":"1990","unstructured":"Grone R, Merris R, Sunder VS (1990) The Laplacian spectrum of a graph. SIAM J Matrix Anal Appl 11:218\u2013238","journal-title":"SIAM J Matrix Anal Appl"},{"key":"3227_CR15","doi-asserted-by":"publisher","first-page":"1148","DOI":"10.1016\/j.laa.2010.04.046","volume":"433","author":"J-M Guo","year":"2010","unstructured":"Guo J-M (2010) The algebraic connectivity of graphs under perturbation. Linear Algebra Appl 433:1148\u20131153","journal-title":"Linear Algebra Appl"},{"key":"3227_CR16","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0024-3795(01)00312-3","volume":"341","author":"SJ Kirkland","year":"2002","unstructured":"Kirkland SJ, Molitierno JJ, Neumann M, Shader B (2002) On graphs with equal algebraic and vertex connectivity. Linear Algebra Appl 341:45\u201356","journal-title":"Linear Algebra Appl"},{"key":"3227_CR17","unstructured":"Ko CW, Shepherd FB (1994) Adding an identity to a totally unimodular matrix, LSEO"},{"issue":"1","key":"3227_CR18","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/S0020-0190(01)00185-5","volume":"81","author":"VV Lozin","year":"2002","unstructured":"Lozin VV (2002) On maximum induced matchings in bipartite graphs. Inf Process Lett 81(1):7\u201311","journal-title":"Inf Process Lett"},{"key":"3227_CR19","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1080\/03081088708817827","volume":"22","author":"R Merris","year":"1987","unstructured":"Merris R (1987) Characteristic vertices of trees. Linear Multilinear Algebra 22:15\u2013131","journal-title":"Linear Multilinear Algebra"},{"key":"3227_CR20","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0024-3795(02)00454-8","volume":"362","author":"JJ Molitierno","year":"2003","unstructured":"Molitierno JJ, Neumann M (2003) On trees with perfect matchings. Linear Algebra Appl 362:75\u201385","journal-title":"Linear Algebra Appl"},{"key":"3227_CR21","doi-asserted-by":"publisher","first-page":"1421","DOI":"10.1016\/j.laa.2007.08.031","volume":"428","author":"JY Shao","year":"2008","unstructured":"Shao JY, Guo J-M, Shan HY (2008) The ordering of trees and connected graphs by algebraic connectivity. Linear Algebra Appl 428:1421\u20131438","journal-title":"Linear Algebra Appl"},{"key":"3227_CR22","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.laa.2007.07.018","volume":"427","author":"XD Zhang","year":"2007","unstructured":"Zhang XD (2007) Ordering trees with algebraic connectivity and diameter. Linear Algebra Appl 427:301\u2013312","journal-title":"Linear Algebra Appl"},{"key":"3227_CR23","doi-asserted-by":"publisher","first-page":"1989","DOI":"10.1007\/s00373-012-1206-7","volume":"29","author":"B Zhu","year":"2013","unstructured":"Zhu B (2013) The algebraic connectivity of graphs with given matching number. Graphs Combin 29:1989\u20131995","journal-title":"Graphs Combin"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03227-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-025-03227-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03227-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T15:22:06Z","timestamp":1757172126000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-025-03227-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,12]]},"references-count":23,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["3227"],"URL":"https:\/\/doi.org\/10.1007\/s40314-025-03227-6","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2025,5,12]]},"assertion":[{"value":"30 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 December 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 April 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 May 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"No conflict of interest to this work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"280"}}