{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T03:22:17Z","timestamp":1780629737991,"version":"3.54.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2012,7,10]],"date-time":"2012-07-10T00:00:00Z","timestamp":1341878400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1007\/s00373-012-1206-7","type":"journal-article","created":{"date-parts":[[2012,7,9]],"date-time":"2012-07-09T05:49:35Z","timestamp":1341812975000},"page":"1989-1995","source":"Crossref","is-referenced-by-count":4,"title":["The Algebraic Connectivity of Graphs with Given Matching Number"],"prefix":"10.1007","volume":"29","author":[{"given":"Bao-Xuan","family":"Zhu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,7,10]]},"reference":[{"key":"1206_CR1","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.laa.2006.08.017","volume":"423","author":"N.M.M. de Abreu","year":"2007","unstructured":"de Abreu N.M.M.: Old and new results on algebraic connectivity of graphs. Linear Algebra Appl. 423, 53\u201373 (2007)","journal-title":"Linear Algebra Appl."},{"key":"1206_CR2","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1016\/j.laa.2008.09.030","volume":"430","author":"T. Biyiko\u011flu","year":"2009","unstructured":"Biyiko\u011flu T., Leydold J.: Algebraic connectivity and degree sequences of trees. Linear Algebra Appl. 430, 811\u2013817 (2009)","journal-title":"Linear Algebra Appl."},{"key":"1206_CR3","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0012-365X(01)00355-7","volume":"254","author":"S. Fallat","year":"2002","unstructured":"Fallat S., Kirkland S., Pati S.: Minimizing algebraic connectivity over connected graphs with fixed girth. Discret. Math. 254, 115\u2013142 (2002)","journal-title":"Discret. Math."},{"key":"1206_CR4","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1080\/0308108031000069182","volume":"51","author":"S. Fallat","year":"2003","unstructured":"Fallat S., Kirkland S., Pati S.: Maximizing algebraic connectivity over unicyclic graphs. Linear Multilinear Algebra 51, 221\u2013241 (2003)","journal-title":"Linear Multilinear Algebra"},{"key":"1206_CR5","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. Czech. Math. J. 23, 298\u2013305 (1973)","journal-title":"Czech. Math. J."},{"key":"1206_CR6","doi-asserted-by":"crossref","first-page":"619","DOI":"10.21136\/CMJ.1975.101357","volume":"25","author":"M. Fiedler","year":"1975","unstructured":"Fiedler M.: A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czech. Math. J. 25, 619\u2013633 (1975)","journal-title":"Czech. Math. J."},{"key":"1206_CR7","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1137\/S0895480191222653","volume":"7","author":"R. Grone","year":"1994","unstructured":"Grone R., Merris R.: The Laplacian spectrum of a graph. SIAM J. Discret. Math. 7, 221\u2013229 (1994)","journal-title":"SIAM J. Discret. Math."},{"key":"1206_CR8","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF01787574","volume":"6","author":"R. Grone","year":"1990","unstructured":"Grone R., Merris R.: Ordering trees by algebraic connectivity. Graphs Combin. 6, 229\u2013237 (1990)","journal-title":"Graphs Combin."},{"key":"1206_CR9","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1137\/0611016","volume":"11","author":"R. Grone","year":"1990","unstructured":"Grone R., Merris R., Sunder V.S.: The Laplacian spectrum of a graph. SIAM J. Matrix Anal. Appl. 11, 218\u2013238 (1990)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1206_CR10","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0024-3795(01)00312-3","volume":"341","author":"S. Kirkland","year":"2002","unstructured":"Kirkland S., Molitierno J., Neumann M., Shader B.: On graphs with equal algebraic and vertex connectivity. Linear Algebra Appl. 341, 45\u201356 (2002)","journal-title":"Linear Algebra Appl."},{"key":"1206_CR11","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s00373-010-0975-0","volume":"27","author":"A.K. Lal","year":"2011","unstructured":"Lal A.K., Patra K.L., Sahoo B.K.: Algebraic connectivity of connected graphs with fixed number of pendant vertices. Graphs Combin. 27, 215\u2013229 (2011)","journal-title":"Graphs Combin."},{"key":"1206_CR12","first-page":"471","volume":"29","author":"L. Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz L., Plummer M.D.: Matching theory. Ann. Discret. Math. 29, 471\u2013480 (1986)","journal-title":"Ann. Discret. Math."},{"key":"1206_CR13","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0024-3795(02)00454-8","volume":"362","author":"J. Molitierno","year":"2003","unstructured":"Molitierno J., Neumann M.: On trees with perfect matchings. Linear Algebra Appl. 362, 75\u201385 (2003)","journal-title":"Linear Algebra Appl."},{"key":"1206_CR14","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1080\/03081088708817827","volume":"22","author":"R. Merris","year":"1987","unstructured":"Merris R.: Characteristic vertices of trees. Linear Multilinear Algebra 22, 15\u2013131 (1987)","journal-title":"Linear Multilinear Algebra"},{"key":"1206_CR15","doi-asserted-by":"crossref","first-page":"1421","DOI":"10.1016\/j.laa.2007.08.031","volume":"428","author":"J.-Y. Shao","year":"2008","unstructured":"Shao J.-Y., Guo J.-M., Shan H.-Y.: The ordering of trees and connected graphs by algebraic connectivity. Linear Algebra Appl. 428, 1421\u20131438 (2008)","journal-title":"Linear Algebra Appl."},{"key":"1206_CR16","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/j.laa.2007.07.018","volume":"427","author":"X.-D. Zhang","year":"2007","unstructured":"Zhang X.-D.: Ordering trees with algebraic connectivity and diameter. Linear Algebra Appl. 427, 301\u2013312 (2007)","journal-title":"Linear Algebra Appl."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1206-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1206-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1206-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,20]],"date-time":"2022-01-20T17:01:17Z","timestamp":1642698077000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1206-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,10]]},"references-count":16,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["1206"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1206-7","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7,10]]}}}