{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:54:50Z","timestamp":1740142490909,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T00:00:00Z","timestamp":1691107200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T00:00:00Z","timestamp":1691107200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071158"],"award-info":[{"award-number":["12071158"]}],"id":[{"id":"10.13039\/501100001809","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":[[2023,9]]},"DOI":"10.1007\/s40314-023-02404-9","type":"journal-article","created":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T16:00:36Z","timestamp":1691164836000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimizing the distance spectral radius of uniform hypertrees with given parameters"],"prefix":"10.1007","volume":"42","author":[{"given":"Chengli","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7321-9554","authenticated-orcid":false,"given":"Bo","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,4]]},"reference":[{"key":"2404_CR1","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.laa.2014.06.010","volume":"458","author":"M Aouchiche","year":"2014","unstructured":"Aouchiche M, Hansen P (2014) Distance spectra of graphs: a survey. Linear Algebra Appl 458:301\u2013386. https:\/\/doi.org\/10.1016\/j.laa.2014.06.010","journal-title":"Linear Algebra Appl"},{"key":"2404_CR2","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1021\/ci00004a014","volume":"31","author":"AT Balaban","year":"1991","unstructured":"Balaban AT, Ciubotariu D, Medeleanu M (1991) Topological indices and real number vertex invariants based on graph eigenvalues or eigenvectors. J Chem Inf Comput Sci 31:517\u2013523. https:\/\/doi.org\/10.1021\/ci00004a014","journal-title":"J Chem Inf Comput Sci"},{"key":"2404_CR3","doi-asserted-by":"publisher","first-page":"3268","DOI":"10.1016\/j.laa.2011.11.018","volume":"436","author":"J Cooper","year":"2012","unstructured":"Cooper J, Dutle A (2012) Spectra of uniform hypergraphs. Linear Algebra Appl 436:3268\u20133292. https:\/\/doi.org\/10.1016\/j.laa.2011.11.018","journal-title":"Linear Algebra Appl"},{"key":"2404_CR4","doi-asserted-by":"publisher","first-page":"1287","DOI":"10.1080\/03081087.2012.750654","volume":"61","author":"Z Du","year":"2013","unstructured":"Du Z, Ili\u0107 A, Feng L (2013) Further results on the distance spectral radius of graphs. Linear Multilinear Algebra 61:1287\u20131301. https:\/\/doi.org\/10.1080\/03081087.2012.750654","journal-title":"Linear Multilinear Algebra"},{"key":"2404_CR5","doi-asserted-by":"publisher","first-page":"2495","DOI":"10.1002\/j.1538-7305.1971.tb02618.x","volume":"50","author":"RL Graham","year":"1971","unstructured":"Graham RL, Pollak HO (1971) On the addressing problem for loop switching. Bell System Tech J 50:2495\u20132519","journal-title":"Bell System Tech J"},{"key":"2404_CR6","first-page":"569","volume":"37","author":"I Gutman","year":"1998","unstructured":"Gutman I, Medeleanu M (1998) On the structure-dependence of the largest eigenvalue of the distance matrix of an alkane. Indian J Chem A 37:569\u2013573","journal-title":"Indian J Chem A"},{"key":"2404_CR7","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1016\/j.laa.2016.06.011","volume":"506","author":"H Lin","year":"2016","unstructured":"Lin H, Zhou B (2016) Distance spectral radius of uniform hypergraphs. Linear Algebra Appl 506:564\u2013578. https:\/\/doi.org\/10.1016\/j.laa.2016.06.011","journal-title":"Linear Algebra Appl"},{"key":"2404_CR8","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.dam.2017.12.011","volume":"239","author":"H Lin","year":"2018","unstructured":"Lin H, Zhou B (2018) On distance spectral radius of uniform hypergraphs with cycles. Discrete Appl Math 239:125\u2013143. https:\/\/doi.org\/10.1016\/j.dam.2017.12.011","journal-title":"Discrete Appl Math"},{"key":"2404_CR9","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1080\/03081087.2017.1301366","volume":"66","author":"H Lin","year":"2018","unstructured":"Lin H, Zhou B, Li Y (2018) On distance spectral radius of uniform hypergraphs. Linear Multilinear Algebra 66:497\u2013513. https:\/\/doi.org\/10.1080\/03081087.2017.1301366","journal-title":"Linear Multilinear Algebra"},{"key":"2404_CR10","first-page":"29","volume":"50","author":"H Lin","year":"2021","unstructured":"Lin H, Shu J, Xue J, Zhang Y (2021) A survey on distance spectra of graphs. Adv Math (China) 50:29\u201376","journal-title":"Adv Math (China)"},{"key":"2404_CR11","doi-asserted-by":"publisher","first-page":"2558","DOI":"10.1080\/03081087.2019.1682497","volume":"69","author":"X Liu","year":"2021","unstructured":"Liu X, Wang L, Li X (2021) Distance spectral radii of $$k$$-uniform hypertrees with given parameters. Linear Multilinear Algebra 69:2558\u20132571. https:\/\/doi.org\/10.1080\/03081087.2019.1682497","journal-title":"Linear Multilinear Algebra"},{"key":"2404_CR12","doi-asserted-by":"publisher","first-page":"2021","DOI":"10.2298\/FIL1509021L","volume":"29","author":"Z Luo","year":"2015","unstructured":"Luo Z, Zhou B (2015) On distance spectral radius of trees and fixed maximum degree. Filomat 29:2021\u20132026","journal-title":"Filomat"},{"key":"2404_CR13","volume-title":"Nonnegative matrices","author":"H Minc","year":"1988","unstructured":"Minc H (1988) Nonnegative matrices. Wiley, New York"},{"key":"2404_CR14","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/j.laa.2014.05.005","volume":"457","author":"V Nikiforov","year":"2014","unstructured":"Nikiforov V (2014) Analytic methods for uniform hypergraphs. Linear Algebra Appl 457:455\u2013535. https:\/\/doi.org\/10.1016\/j.laa.2014.05.005","journal-title":"Linear Algebra Appl"},{"key":"2404_CR15","doi-asserted-by":"publisher","first-page":"2240","DOI":"10.1016\/j.laa.2013.06.030","volume":"439","author":"W Ning","year":"2013","unstructured":"Ning W, Ouyang L, Lu M (2013) Distance spectral radius of trees with fixed number of pendant vertices. Linear Algebra Appl 439:2240\u20132249. https:\/\/doi.org\/10.1016\/j.laa.2013.06.030","journal-title":"Linear Algebra Appl"},{"key":"2404_CR16","doi-asserted-by":"publisher","first-page":"1234","DOI":"10.1016\/j.laa.2009.04.020","volume":"431","author":"S Sivasubramanian","year":"2009","unstructured":"Sivasubramanian S (2009) $$q$$-analogs of distance matrices of $$3$$-hypertrees. Linear Algebra Appl 431:1234\u20131248. https:\/\/doi.org\/10.1016\/j.laa.2009.04.020","journal-title":"Linear Algebra Appl"},{"key":"2404_CR17","doi-asserted-by":"publisher","first-page":"168","DOI":"10.13001\/1081-3810.1366","volume":"20","author":"D Stevanovi\u0107","year":"2010","unstructured":"Stevanovi\u0107 D, Ili\u0107 A (2010) Distance spectral radius of trees with fixed maximum degree. Electron J Linear Algebra 20:168\u2013179. https:\/\/doi.org\/10.13001\/1081-3810.1366","journal-title":"Electron J Linear Algebra"},{"key":"2404_CR18","first-page":"139","volume-title":"Distance in molecular graphs theory","author":"D Stevanovi\u0107","year":"2010","unstructured":"Stevanovi\u0107 D, Ili\u0107 A (2010) Spectral properties of distance matrix of graphs. In: Gutman I, Furtula B (eds) Distance in molecular graphs theory. University of Kragujevac, Kragujevac, pp 139\u2013176"},{"key":"2404_CR19","doi-asserted-by":"publisher","first-page":"3490","DOI":"10.1016\/j.laa.2012.12.024","volume":"438","author":"Y Wang","year":"2013","unstructured":"Wang Y, Zhou B (2013) On distance spectral radius of graphs. Linear Algebra Appl 438:3490\u20133503. https:\/\/doi.org\/10.1016\/j.laa.2012.12.024","journal-title":"Linear Algebra Appl"},{"key":"2404_CR20","doi-asserted-by":"publisher","first-page":"2232","DOI":"10.1080\/03081087.2017.1391167","volume":"66","author":"Y Wang","year":"2018","unstructured":"Wang Y, Zhou B (2018) On distance spectral radius of hypergraphs. Linear Multilinear Algebra 66:2232\u20132246. https:\/\/doi.org\/10.1080\/03081087.2017.1391167","journal-title":"Linear Multilinear Algebra"},{"key":"2404_CR21","doi-asserted-by":"publisher","first-page":"411","DOI":"10.13001\/ela.2020.5121","volume":"36","author":"Y Wang","year":"2020","unstructured":"Wang Y, Zhou B (2020) Extremal properties of the distance spectral radius of hypergraphs. Electron J Linear Algebra 36:411\u2013429. https:\/\/doi.org\/10.13001\/ela.2020.5121","journal-title":"Electron J Linear Algebra"},{"key":"2404_CR22","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1137\/110831520","volume":"26","author":"S Watanabe","year":"2012","unstructured":"Watanabe S, Ishi K, Sawa M (2012) A $$q$$-analogue of the addressing problem of graphs by Graham and Pollak. SIAM J Discrete Math 26:527\u2013536. https:\/\/doi.org\/10.1137\/110831520","journal-title":"SIAM J Discrete Math"},{"key":"2404_CR23","first-page":"351","volume":"134","author":"G Yu","year":"2017","unstructured":"Yu G, Guo S, Zhai M (2017) Distance spectral radius of a tree with given diameter. Ars Combin 134:351\u2013362","journal-title":"Ars Combin"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-023-02404-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-023-02404-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-023-02404-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,11]],"date-time":"2023-09-11T05:13:51Z","timestamp":1694409231000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-023-02404-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,4]]},"references-count":23,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["2404"],"URL":"https:\/\/doi.org\/10.1007\/s40314-023-02404-9","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2023,8,4]]},"assertion":[{"value":"26 September 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 July 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 July 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 August 2023","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 there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"272"}}