{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:08:05Z","timestamp":1758823685989},"reference-count":8,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2019,4]]},"abstract":"<jats:p> In this paper, we determine the unique tree that maximizes the distance spectral radius in the class of all trees in which each non-pendent vertex has degree at least [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s1793830919500253","type":"journal-article","created":{"date-parts":[[2019,2,18]],"date-time":"2019-02-18T03:32:43Z","timestamp":1550460763000},"page":"1950025","source":"Crossref","is-referenced-by-count":1,"title":["Maximal distance spectral radius of trees"],"prefix":"10.1142","volume":"11","author":[{"given":"S. S.","family":"Bose","sequence":"first","affiliation":[{"name":"Department of Mathematical Sciences, Tezpur University, Tezpur-784028, India"}]},{"given":"M.","family":"Nath","sequence":"additional","affiliation":[{"name":"Department of Mathematical Sciences, Tezpur University, Tezpur-784028, India"}]},{"given":"D.","family":"Sarma","sequence":"additional","affiliation":[{"name":"Department of Mathematical Sciences, Tezpur University, Tezpur-784028, India"}]}],"member":"219","published-online":{"date-parts":[[2019,4,24]]},"reference":[{"key":"S1793830919500253BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2004.06.017"},{"key":"S1793830919500253BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2017.07.012"},{"key":"S1793830919500253BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2010.06.018"},{"key":"S1793830919500253BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2011.07.031"},{"key":"S1793830919500253BIB005","doi-asserted-by":"publisher","DOI":"10.1080\/03081089008818032"},{"key":"S1793830919500253BIB006","doi-asserted-by":"publisher","DOI":"10.13001\/1081-3810.1366"},{"key":"S1793830919500253BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2011.09.007"},{"key":"S1793830919500253BIB008","doi-asserted-by":"publisher","DOI":"10.1080\/03081087.2010.499512"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830919500253","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T19:31:10Z","timestamp":1565119870000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830919500253"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4]]},"references-count":8,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2019,4,24]]},"published-print":{"date-parts":[[2019,4]]}},"alternative-id":["10.1142\/S1793830919500253"],"URL":"https:\/\/doi.org\/10.1142\/s1793830919500253","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4]]}}}