{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T22:04:46Z","timestamp":1781474686208,"version":"3.54.1"},"reference-count":21,"publisher":"EDP Sciences","issue":"1","license":[{"start":{"date-parts":[[2022,2,14]],"date-time":"2022-02-14T00:00:00Z","timestamp":1644796800000},"content-version":"vor","delay-in-days":44,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"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":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2022,1,17]]},"published-print":{"date-parts":[[2022,1]]},"abstract":"<jats:p>For a vertex <jats:italic>u<\/jats:italic> of a tree <jats:italic>T<\/jats:italic>, the leaf (internal, respectively) status of <jats:italic>u<\/jats:italic> is the sum of the distances from <jats:italic>u<\/jats:italic> to all leaves (internal vertices, respectively) of <jats:italic>T<\/jats:italic>. The minimum (maximum, respectively) leaf status of a tree <jats:italic>T<\/jats:italic> is the minimum (maximum, respectively) leaf statuses of all vertices of <jats:italic>T<\/jats:italic>. The minimum (maximum, respectively) internal status of a tree <jats:italic>T<\/jats:italic> is the minimum (maximum, respectively) internal statuses of all vertices of <jats:italic>T<\/jats:italic>. We characterize those trees with the smallest (largest, respectively) extremal (minimum and maximum) leaf status and extremal (minimum and maximum) internal status, respectively. We also study the corresponding extremal problems for trees with given parameters, including diameter or maximum degree.<\/jats:p>","DOI":"10.1051\/ro\/2022010","type":"journal-article","created":{"date-parts":[[2022,1,23]],"date-time":"2022-01-23T20:01:41Z","timestamp":1642968101000},"page":"415-430","source":"Crossref","is-referenced-by-count":2,"title":["On extremal leaf status and internal status"],"prefix":"10.1051","volume":"56","author":[{"given":"Haiyan","family":"Guo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bo","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"250","published-online":{"date-parts":[[2022,2,14]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/net.20450","volume":"58","author":"Aouchiche","year":"2011","journal-title":"Networks"},{"key":"R2","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.dam.2016.04.031","volume":"213","author":"Aouchiche","year":"2016","journal-title":"Discrete Appl. Math."},{"key":"R3","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.dam.2017.01.025","volume":"222","author":"Aouchiche","year":"2017","journal-title":"Discrete Appl. Math."},{"key":"R4","unstructured":"Buckley F. and Harary F., Distance in Graphs. Addison-Wesley Publishing Company, Redwood City, CA (1990)."},{"key":"R5","doi-asserted-by":"crossref","unstructured":"Cheng M., Lin H. and Zhou B., Minimum status of series-reduced trees with given parameters. Bull. Braz. Math. Soc. (N.S.) (2021) DOI: 10.1007\/s00574-021-00278-1.","DOI":"10.1007\/s00574-021-00278-1"},{"key":"R6","first-page":"124949","volume":"371","author":"Dobrynin","year":"2020","journal-title":"Appl. Math. Comput."},{"key":"R7","first-page":"8","volume":"21","author":"Durant","year":"2019","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"R8","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/0020-0190(75)90055-1","volume":"4","author":"Kang","year":"1975","journal-title":"Information Process. Lett."},{"key":"R9","doi-asserted-by":"crossref","first-page":"1384","DOI":"10.1093\/comjnl\/bxaa057","volume":"64","author":"Liang","year":"2021","journal-title":"Comput. J."},{"key":"R10","doi-asserted-by":"crossref","unstructured":"Lin H. and Zhou B., Which numbers are status differences?. Appl. Math. Comput. 399 (2021).","DOI":"10.1016\/j.amc.2021.126004"},{"key":"R11","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/s10878-011-9412-4","volume":"24","author":"Lin","year":"2012","journal-title":"J. Comb. Optim."},{"key":"R12","doi-asserted-by":"crossref","first-page":"S765","DOI":"10.1051\/ro\/2020015","volume":"55","author":"Peng","year":"2021","journal-title":"RAIRO. Oper. Res."},{"key":"R13","doi-asserted-by":"crossref","first-page":"439","DOI":"10.7151\/dmgt.1802","volume":"35","author":"Pravas","year":"2015","journal-title":"Discuss. Math. Graph Theory"},{"key":"R14","doi-asserted-by":"crossref","unstructured":"Qiao P. and Zhan X., The relation between the number of leaves of a tree and its diameter. Czechoslovak Math. J. (2021). DOI: 10.21136\/CMJ.2021.0492-20.","DOI":"10.21136\/CMJ.2021.0492-20"},{"key":"R15","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1002\/net.21558","volume":"64","author":"Rissner","year":"2014","journal-title":"Networks"},{"key":"R16","doi-asserted-by":"crossref","first-page":"1425","DOI":"10.2298\/FIL1308425S","volume":"27","author":"Sedlar","year":"2013","journal-title":"Filomat"},{"key":"R17","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1002\/jgt.3190020304","volume":"2","author":"Slater","year":"1978","journal-title":"J. Graph Theory"},{"key":"R18","doi-asserted-by":"crossref","first-page":"3.17","DOI":"10.37236\/6408","volume":"25","author":"Smith","year":"2018","journal-title":"Electron. J. Combin."},{"key":"R19","doi-asserted-by":"crossref","first-page":"2678","DOI":"10.1016\/j.dam.2013.04.005","volume":"161","author":"Vuki\u010devi\u0107","year":"2013","journal-title":"Discrete Appl. Math."},{"key":"R20","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1007\/s00373-013-1401-1","volume":"31","author":"Wang","year":"2015","journal-title":"Graphs Combin."},{"key":"R21","first-page":"87","volume":"4","author":"Zelinka","year":"1968","journal-title":"Arch. Math. (Brno)"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2022010\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,14]],"date-time":"2022-02-14T08:57:58Z","timestamp":1644829078000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2022010"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1]]},"references-count":21,"journal-issue":{"issue":"1"},"alternative-id":["ro210323"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2022010","relation":{},"ISSN":["0399-0559","2804-7303"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"2804-7303","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1]]}}}