{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T18:26:28Z","timestamp":1649010388840},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"5","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,9]]},"DOI":"10.1007\/s00373-012-1205-8","type":"journal-article","created":{"date-parts":[[2012,7,9]],"date-time":"2012-07-09T05:15:46Z","timestamp":1341810946000},"page":"1249-1257","source":"Crossref","is-referenced-by-count":0,"title":["Laplacian Spectral Radius and Maximum Degree of Trees with Perfect Matchings"],"prefix":"10.1007","volume":"29","author":[{"given":"Xiaodan","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianguo","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,7,10]]},"reference":[{"issue":"198","key":"1205_CR1","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0024-3795(94)90486-3","volume":"197","author":"R. Merris","year":"1994","unstructured":"Merris R.: Laplacian matrices of graphs: a survey. Linear Algebra Appl. 197(198), 143\u2013176 (1994)","journal-title":"Linear Algebra Appl."},{"key":"1205_CR2","first-page":"61","volume":"24","author":"I. Gutman","year":"2002","unstructured":"Gutman I.: The star is the tree with greatest Laplacian eigenvalue. Kragujevac J. Math. 24, 61\u201365 (2002)","journal-title":"Kragujevac J. Math."},{"key":"1205_CR3","first-page":"67","volume":"24","author":"M. Petrovi\u0107","year":"2002","unstructured":"Petrovi\u0107 M., Gutman I.: The path is the tree with smallest greatest Laplacian eigenvalue. Kragujevac J. Math. 24, 67\u201370 (2002)","journal-title":"Kragujevac J. Math."},{"key":"1205_CR4","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/S0024-3795(02)00716-4","volume":"368","author":"J.M. Guo","year":"2003","unstructured":"Guo J.M.: On the Laplacian sepectral radius of a tree. Linear Algebra Appl. 368, 379\u2013385 (2003)","journal-title":"Linear Algebra Appl."},{"key":"1205_CR5","doi-asserted-by":"crossref","first-page":"1962","DOI":"10.1016\/j.laa.2008.05.028","volume":"429","author":"A.M. Yu","year":"2008","unstructured":"Yu A.M., Lu M.: Laplacian spectral radius of trees with given maximum degree. Linear Algebra Appl. 429, 1962\u20131969 (2008)","journal-title":"Linear Algebra Appl."},{"key":"1205_CR6","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/j.disc.2005.04.001","volume":"296","author":"Y. Hong","year":"2005","unstructured":"Hong Y., Zhang X.D.: Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrix of trees. Discrete Math. 296, 187\u2013197 (2005)","journal-title":"Discrete Math."},{"key":"1205_CR7","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1016\/j.laa.2006.06.004","volume":"419","author":"J.M. Guo","year":"2006","unstructured":"Guo J.M.: On the Laplacian spectral radius of trees with fixed diameter. Linear Algebra Appl. 419, 618\u2013629 (2006)","journal-title":"Linear Algebra Appl."},{"key":"1205_CR8","doi-asserted-by":"crossref","first-page":"3143","DOI":"10.1016\/j.disc.2007.06.017","volume":"308","author":"X.D. Zhang","year":"2008","unstructured":"Zhang X.D.: The Laplacian spectral radii of trees with degree sequences. Discrete Math. 308, 3143\u20133150 (2008)","journal-title":"Discrete Math."},{"key":"1205_CR9","doi-asserted-by":"crossref","first-page":"4241","DOI":"10.1016\/j.disc.2008.12.026","volume":"309","author":"X.Y. Yuan","year":"2009","unstructured":"Yuan X.Y., Shan H.Y., Liu Y.: On the Laplacian spectral radii of trees. Discrete Math. 309, 4241\u20134246 (2009)","journal-title":"Discrete Math."},{"key":"1205_CR10","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s10910-008-9399-y","volume":"46","author":"X.Y. Yuan","year":"2009","unstructured":"Yuan X.Y., Shao J.Y., He C.X.: On the Laplacian spectral radii of trees with perfect matchings. J. Math. Chem. 46, 65\u201385 (2009)","journal-title":"J. Math. Chem."},{"issue":"11","key":"1205_CR11","first-page":"1568","volume":"35","author":"M. Fang","year":"2007","unstructured":"Fang M.: On Laplacian radii of trees with perfect matching (in Chinese). J. Tongji Univ. (Nat. Sci.) 35(11), 1568\u20131571 (2007)","journal-title":"J. Tongji Univ. (Nat. Sci.)"},{"key":"1205_CR12","first-page":"13","volume":"2","author":"X.Y. Yuan","year":"2004","unstructured":"Yuan X.Y., Wu B.F., Xiao E.L.: The modifications of trees and the Laplacian spectrum (in Chinese). J. East China Norm. Univ. (Nat. Sci.) 2, 13\u201318 (2004)","journal-title":"J. East China Norm. Univ. (Nat. Sci.)"},{"key":"1205_CR13","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.laa.2005.08.002","volume":"413","author":"J.M. Guo","year":"2006","unstructured":"Guo J.M.: The effect on the Laplacian spectral radius of a graph by adding or grafting edges. Linear Algebra Appl. 413, 59\u201371 (2006)","journal-title":"Linear Algebra Appl."},{"key":"1205_CR14","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/j.laa.2005.02.031","volume":"404","author":"J.M. Guo","year":"2005","unstructured":"Guo J.M.: On the second largest Laplacian eigenvalue of trees. Linear Algebra Appl. 404, 251\u2013261 (2005)","journal-title":"Linear Algebra Appl."},{"key":"1205_CR15","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/S0024-3795(98)10149-0","volume":"285","author":"J.S. Li","year":"1998","unstructured":"Li J.S., Zhang X.D.: On the Laplacian eigenvalues of a graph. Linear Algebra Appl. 285, 305\u2013307 (1998)","journal-title":"Linear Algebra Appl."},{"key":"1205_CR16","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0012-365X(02)00746-X","volume":"269","author":"A. Chang","year":"2003","unstructured":"Chang A.: On the largest eigenvalue of a tree with perfect matchings. Discrete Math. 269, 45\u201363 (2003)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1205-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1205-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1205-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:59:34Z","timestamp":1559055574000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1205-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,10]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["1205"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1205-8","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]]}}}