{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T23:32:26Z","timestamp":1780615946214,"version":"3.54.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,2,17]],"date-time":"2022-02-17T00:00:00Z","timestamp":1645056000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,2,17]],"date-time":"2022-02-17T00:00:00Z","timestamp":1645056000000},"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":["Acta Informatica"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s00236-022-00416-2","type":"journal-article","created":{"date-parts":[[2022,2,17]],"date-time":"2022-02-17T08:02:32Z","timestamp":1645084952000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Minimum status of trees with a given degree sequence"],"prefix":"10.1007","volume":"60","author":[{"given":"Haiyan","family":"Guo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7321-9554","authenticated-orcid":false,"given":"Bo","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,2,17]]},"reference":[{"key":"416_CR1","doi-asserted-by":"crossref","unstructured":"Ai, J., Gerke, S., Gutin, G., Mafunda, S.: Proximity and remoteness in directed and undirected graphs. Discrete Math. 34, 112252 (2021). https:\/\/doi.org\/10.1016\/j.disc.2020.112252","DOI":"10.1016\/j.disc.2020.112252"},{"key":"416_CR2","doi-asserted-by":"crossref","unstructured":"Aouchiche, M., Hansen, P.: Proximity and remoteness in graphs: results and conjectures. Networks 58(2), 95\u2013102 (2011). https:\/\/doi.org\/10.1002\/net.20450","DOI":"10.1002\/net.20450"},{"key":"416_CR3","doi-asserted-by":"crossref","unstructured":"Aouchiche, M., Hansen, P.: Nordhaus\u2013Gaddum relations for proximity and remoteness in graphs. Comput. Math. Appl. 59(8), 2827\u20132835 (2010). https:\/\/doi.org\/10.1016\/j.camwa.2010.02.001","DOI":"10.1016\/j.camwa.2010.02.001"},{"key":"416_CR4","doi-asserted-by":"crossref","unstructured":"Aouchiche, M., Hansen, P.: Proximity, remoteness and girth in graphs. Discrete Appl. Math. 222, 31\u201339 (2017). https:\/\/doi.org\/10.1016\/j.dam.2017.01.025","DOI":"10.1016\/j.dam.2017.01.025"},{"key":"416_CR5","doi-asserted-by":"crossref","unstructured":"B\u0131y\u0131ko\u01e7lu, T., Leydold, J.: Graphs with given degree sequence and maximal spectral radius. Electron. J. Combin. 15(1), 119 (2008). https:\/\/doi.org\/10.37236\/843","DOI":"10.37236\/843"},{"key":"416_CR6","doi-asserted-by":"crossref","unstructured":"Brandes, U.: Central positions in social networks. In: Fernau, G. (ed.) Computer Science\u2014Theory and Applications\u201415th International Computer Science Symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29\u2013July 3, 2020, Proceedings, volume 12159 of Lecture Notes in Computer Science, pp. 30\u201345. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-50026-9_3","DOI":"10.1007\/978-3-030-50026-9_3"},{"key":"416_CR7","volume-title":"Distance in Graphs","author":"F Buckley","year":"1990","unstructured":"Buckley, F., Harary, F.: Distance in Graphs. Addison-Wesley Publishing Company, Redwood City (1990)"},{"key":"416_CR8","doi-asserted-by":"crossref","unstructured":"Dankelmann, P.: Proximity, remoteness and minimum degree. Discrete Appl. Math. 184, 223\u2013228 (2015). https:\/\/doi.org\/10.1016\/j.dam.2014.11.012","DOI":"10.1016\/j.dam.2014.11.012"},{"key":"416_CR9","doi-asserted-by":"crossref","unstructured":"Freeman, L.C.: Centrality in social networks conceptual clarification. Soc. Netw. 1(3), 215\u2013239 (1978\/1979). https:\/\/doi.org\/10.1016\/0378-8733(78)90021-7","DOI":"10.1016\/0378-8733(78)90021-7"},{"key":"416_CR10","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/B978-0-12-405531-5.00003-1","volume-title":"Analyzing the Social Web","author":"J Golbeck","year":"2013","unstructured":"Golbeck, J.: Analyzing the Social Web, pp. 25\u201344. Morgan Kaufmann, Burlington (2013)"},{"key":"416_CR11","doi-asserted-by":"crossref","unstructured":"Goldman, A.J.: Optimal center location in simple networks. Transp. Sci. 5(2), 212\u2013221 (1971). https:\/\/doi.org\/10.1287\/trsc.5.2.212","DOI":"10.1287\/trsc.5.2.212"},{"key":"416_CR12","doi-asserted-by":"crossref","unstructured":"Kang, A.N.C., Ault, D.A.: Some properties of a centroid of a free tree. Inf. Process. Lett. 4(1), 18\u201320 (1975). https:\/\/doi.org\/10.1016\/0020-0190(75)90055-1","DOI":"10.1016\/0020-0190(75)90055-1"},{"key":"416_CR13","doi-asserted-by":"crossref","unstructured":"Liang, C., Zhou, B., Guo, H.: Minimum status, matching and domination of graphs. Comput. J. 64(9), 1384\u20131392 (2021). https:\/\/doi.org\/10.1093\/comjnl\/bxaa057","DOI":"10.1093\/comjnl\/bxaa057"},{"key":"416_CR14","doi-asserted-by":"crossref","unstructured":"Lin, C., Tsai, W.H., Shang, J.L., Zhang, Y.J.: Minimum statuses of connected graphs with fixed maximum degree and order. J. Comb. Optim. 24(3), 147\u2013161 (2012). https:\/\/doi.org\/10.1007\/s10878-011-9412-4","DOI":"10.1007\/s10878-011-9412-4"},{"key":"416_CR15","doi-asserted-by":"crossref","unstructured":"Lin, H., Zhou, B.: Which numbers are status differences? Appl. Math. Comput. 399, 126004 (2021). https:\/\/doi.org\/10.1016\/j.amc.2021.126004","DOI":"10.1016\/j.amc.2021.126004"},{"key":"416_CR16","doi-asserted-by":"crossref","unstructured":"Ma, B., Wu, B., Zhang, W.: Proximity and average eccentricity of a graph. Inf. Process. Lett. 112(10), 392\u2013395 (2012). https:\/\/doi.org\/10.1016\/j.ipl.2012.02.001","DOI":"10.1016\/j.ipl.2012.02.001"},{"key":"416_CR17","doi-asserted-by":"crossref","unstructured":"Peng, Z., Zhou, B.: Minimun status of trees with given parameters. RAIRO Oper. Res. 55, S765\u2013S785 (2021). https:\/\/doi.org\/10.1051\/ro\/2020015","DOI":"10.1051\/ro\/2020015"},{"key":"416_CR18","doi-asserted-by":"crossref","unstructured":"Rissner, R., Burkard, R.E.: Bounds on the radius and status of graphs. Networks 64(2), 76\u201383 (2014). https:\/\/doi.org\/10.1002\/net.21558","DOI":"10.1002\/net.21558"},{"issue":"8","key":"416_CR19","doi-asserted-by":"publisher","first-page":"1425","DOI":"10.2298\/FIL1308425S","volume":"27","author":"J Sedlar","year":"2013","unstructured":"Sedlar, J.: Remoteness, proximity and few other distance invariants in graphs. Filomat 27(8), 1425\u20131435 (2013)","journal-title":"Filomat"},{"key":"416_CR20","doi-asserted-by":"crossref","unstructured":"Vuki\u010devi\u0107, D., Caporossi, G.: Network descriptors based on betweenness centrality and transmission and their extremal values. Discrete Appl. Math. 161(16\u201317), 2678\u20132686 (2013). https:\/\/doi.org\/10.1016\/j.dam.2013.04.005","DOI":"10.1016\/j.dam.2013.04.005"},{"key":"416_CR21","doi-asserted-by":"crossref","unstructured":"Wang, H.: The extremal values of the Wiener index of a tree with given degree sequence. Discrete Appl. Math. 156(14), 2647\u20132654 (2008). https:\/\/doi.org\/10.1016\/j.dam.2007.11.005","DOI":"10.1016\/j.dam.2007.11.005"},{"issue":"2","key":"416_CR22","first-page":"87","volume":"4","author":"B Zelinka","year":"1968","unstructured":"Zelinka, B.: Medians and peripherians of a tree. Arch. Math. 4(2), 87\u201395 (1968)","journal-title":"Arch. Math."},{"issue":"2","key":"416_CR23","first-page":"623","volume":"60","author":"X Zhang","year":"2008","unstructured":"Zhang, X., Xiang, Q., Xu, L., Pan, R.: The Wiener index of trees with given degree sequences. MATCH Commun. Math. Comput. Chem. 60(2), 623\u2013644 (2008)","journal-title":"MATCH Commun. Math. Comput. Chem."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-022-00416-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00236-022-00416-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-022-00416-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,27]],"date-time":"2023-02-27T05:03:22Z","timestamp":1677474202000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00236-022-00416-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,17]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["416"],"URL":"https:\/\/doi.org\/10.1007\/s00236-022-00416-2","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,17]]},"assertion":[{"value":"14 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 January 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}