{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:54:59Z","timestamp":1740142499000,"version":"3.37.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,8,16]],"date-time":"2021-08-16T00:00:00Z","timestamp":1629072000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,16]],"date-time":"2021-08-16T00:00:00Z","timestamp":1629072000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["141298\/2016-2","312309\/2017-1"],"award-info":[{"award-number":["141298\/2016-2","312309\/2017-1"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s40314-021-01609-0","type":"journal-article","created":{"date-parts":[[2021,8,16]],"date-time":"2021-08-16T15:02:58Z","timestamp":1629126178000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On trees with algebraic connectivity greater than or equal to $$2\\left( 1-\\cos \\left( \\frac{\\pi }{7}\\right) \\right) $$"],"prefix":"10.1007","volume":"40","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6885-151X","authenticated-orcid":false,"given":"Diego","family":"de Souza Maceira Belay","sequence":"first","affiliation":[]},{"given":"Maria Aguieiras A.","family":"de Freitas","sequence":"additional","affiliation":[]},{"suffix":"Jr.","given":"Celso M.","family":"da Silva","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,16]]},"reference":[{"key":"1609_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.laa.2006.08.017","volume":"423","author":"NMM Abreu","year":"2007","unstructured":"Abreu NMM (2007) Old and new results on algebraic connectivity of graphs. Linear Algebra Appl 423:53\u201373","journal-title":"Linear Algebra Appl"},{"key":"1609_CR2","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1016\/j.laa.2014.06.016","volume":"458","author":"NMM Abreu","year":"2014","unstructured":"Abreu NMM, Justel CM, Rojo O, Trevisan V (2014) Ordering trees and graphs with few cycles by algebraic connectivity. Linear Algebra Appl 458:429\u2013453","journal-title":"Linear Algebra Appl"},{"key":"1609_CR3","volume-title":"Spectra of graphs\u2014theory and applications","author":"D Cvetkovi\u0107","year":"1995","unstructured":"Cvetkovi\u0107 D, Doob M, Sachs H (1995) Spectra of graphs\u2014theory and applications, 3rd edn. Johann Ambrosius Barth Verlag, Heidelberg","edition":"3"},{"key":"1609_CR4","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. Czechoslovak Math J 23:298\u2013305","journal-title":"Czechoslovak Math J"},{"key":"1609_CR5","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF01787574","volume":"6","author":"R Grone","year":"1990","unstructured":"Grone R, Merris R (1990) Ordering trees by algebraic connectivity. Graphs Comb 6:229\u2013237","journal-title":"Graphs Comb"},{"key":"1609_CR6","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/S0024-3795(02)00413-5","volume":"373","author":"S Kirkland","year":"2003","unstructured":"Kirkland S (2003) A note on limit points for algebraic connectivity. Linear Algebra Appl 373:5\u201311","journal-title":"Linear Algebra Appl"},{"key":"1609_CR7","first-page":"1","volume":"36","author":"S Kirkland","year":"2007","unstructured":"Kirkland S (2007) Algebraic connectivity. Handbook of linear. Algebra 36:1\u201312","journal-title":"Algebra"},{"key":"1609_CR8","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1080\/03081089608818448","volume":"40","author":"S Kirkland","year":"1996","unstructured":"Kirkland S, Neumann M, Shader B (1996) Characteristic vertices of weighted trees via perron values. Linear Multilinear Algebra 40:311\u2013325","journal-title":"Linear Multilinear Algebra"},{"key":"1609_CR9","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.jsc.2013.09.003","volume":"60","author":"BD McKay","year":"2014","unstructured":"McKay BD, Piperno A (2014) Practical graph isomorphism, II. J Symb Comput 60:94\u2013112","journal-title":"J Symb Comput"},{"key":"1609_CR10","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1016\/j.laa.2007.08.018","volume":"428","author":"K Patra","year":"2008","unstructured":"Patra K, Lal A (2008) The effect on the algebraic connectivity of a tree by grafting or collapsing of edges. Linear Algebra Appl 428:855\u2013864","journal-title":"Linear Algebra Appl"},{"key":"1609_CR11","unstructured":"The Sage Developers (2020) SageMath, the Sage mathematics software system (version 9.1). https:\/\/www.sagemath.org. Accessed 30 Sep 2020"},{"key":"1609_CR12","doi-asserted-by":"publisher","first-page":"3684","DOI":"10.1016\/j.laa.2012.01.011","volume":"436","author":"XK Wang","year":"2012","unstructured":"Wang XK, Tan SW (2012) Ordering trees by algebraic connectivity. Linear Algebra Appl 436:3684\u20133691","journal-title":"Linear Algebra Appl"},{"key":"1609_CR13","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1016\/j.dam.2007.08.014","volume":"156","author":"XY Yuan","year":"2008","unstructured":"Yuan XY, Shao JY, Zhang L (2008) The six classes of trees with the largest algebraic connectivity. Discrete Appl Math 156:757\u2013769","journal-title":"Discrete Appl Math"},{"key":"1609_CR14","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"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-021-01609-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-021-01609-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-021-01609-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,24]],"date-time":"2021-09-24T17:36:11Z","timestamp":1632504971000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-021-01609-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,16]]},"references-count":14,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["1609"],"URL":"https:\/\/doi.org\/10.1007\/s40314-021-01609-0","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2021,8,16]]},"assertion":[{"value":"27 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 August 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 August 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 August 2021","order":4,"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 that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"215"}}