{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T23:32:23Z","timestamp":1780615943431,"version":"3.54.1"},"reference-count":31,"publisher":"EDP Sciences","license":[{"start":{"date-parts":[[2021,3,2]],"date-time":"2021-03-02T00:00:00Z","timestamp":1614643200000},"content-version":"vor","delay-in-days":60,"URL":"https:\/\/www.edpsciences.org\/en\/authors\/copyright-and-licensing"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11671156"],"award-info":[{"award-number":["11671156"]}],"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":[[2020,2,12]]},"published-print":{"date-parts":[[2021]]},"abstract":"<jats:p>The status of a vertex <jats:italic>v<\/jats:italic> in a connected graph <jats:italic>G<\/jats:italic> is defined as the sum of the distances from <jats:italic>v<\/jats:italic> to all other vertices in <jats:italic>G<\/jats:italic>. The minimum status of <jats:italic>G<\/jats:italic> is the minimum of status of all vertices of <jats:italic>G<\/jats:italic>. We give the smallest and largest values for the minimum status of a tree with fixed parameters such as the diameter, the number of pendant vertices, the number of odd vertices, and the number of vertices of degree two, and characterize the unique extremal trees.<\/jats:p>","DOI":"10.1051\/ro\/2020015","type":"journal-article","created":{"date-parts":[[2020,2,14]],"date-time":"2020-02-14T12:57:44Z","timestamp":1581685064000},"page":"S765-S785","source":"Crossref","is-referenced-by-count":8,"special_numbering":"Supplement","title":["Minimum status of trees with given parameters"],"prefix":"10.1051","volume":"55","author":[{"given":"Zhene","family":"Peng","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":[[2021,3,2]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"2827","DOI":"10.1016\/j.camwa.2010.02.001","volume":"59","author":"Aouchiche","year":"2010","journal-title":"Comput. Math. Appl"},{"key":"R2","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/net.20450","volume":"58","author":"Aouchiche","year":"2011","journal-title":"Networks"},{"key":"R3","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":"R4","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":"R5","first-page":"365","volume":"58","author":"Aouchiche","year":"2007","journal-title":"MATCH Commun. Math. Comput. Chem"},{"key":"R6","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/j.disopt.2014.01.002","volume":"12","author":"Balakrishnan","year":"2014","journal-title":"Discrete Optim"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"Bergeron F., Leroux P. and Labelle G., Combinatorial Species and Tree-like Structures. Cambridge University Press, Cambridge (1998).","DOI":"10.1017\/CBO9781107325913"},{"key":"R8","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1002\/jgt.3190120408","volume":"12","author":"Buckley","year":"1988","journal-title":"J. Graph Theory"},{"key":"R9","unstructured":"Buckley F. and Harary F., Distance in Graphs. Addison-Wesley Publishing Company, Redwood City, CA (1990)."},{"key":"R10","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/j.dam.2014.11.012","volume":"184","author":"Dankelmann","year":"2015","journal-title":"Discrete Appl. Math"},{"key":"R11","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.disc.2018.09.015","volume":"342","author":"Dobrynin","year":"2019","journal-title":"Discrete Math"},{"key":"R12","doi-asserted-by":"crossref","first-page":"283","DOI":"10.21136\/CMJ.1976.101401","volume":"26","author":"Entringer","year":"1976","journal-title":"Czechoslovak Math. J"},{"key":"R13","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"Freeman","year":"1979","journal-title":"Social Networks"},{"key":"R14","doi-asserted-by":"crossref","unstructured":"Golbeck J., Analyzing the Social Web. Morgan Kaufmann, Burlington, MA (2013) 25\u201344.","DOI":"10.1016\/B978-0-12-405531-5.00003-1"},{"key":"R15","doi-asserted-by":"crossref","first-page":"23","DOI":"10.2307\/2785610","volume":"22","author":"Harary","year":"1959","journal-title":"Sociometry"},{"key":"R16","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF02559543","volume":"101","author":"Harary","year":"1959","journal-title":"Acta Math"},{"key":"R17","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.jctb.2014.02.003","volume":"107","author":"Haslegrave","year":"2014","journal-title":"J. Combin. Theory Ser. B"},{"key":"R18","first-page":"185","volume":"70","author":"Jordan","year":"1869","journal-title":"J. Reine Angew. Math"},{"key":"R19","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/0020-0190(75)90055-1","volume":"4","author":"Kang","year":"1975","journal-title":"Inf. Process. Lett"},{"key":"R20","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1137\/0137041","volume":"37","author":"Kariv","year":"1979","journal-title":"SIAM J. Appl. Math"},{"key":"R21","doi-asserted-by":"crossref","first-page":"2412","DOI":"10.1016\/j.disc.2015.06.011","volume":"338","author":"Krnc","year":"2015","journal-title":"Discrete Math"},{"key":"R22","unstructured":"Liang C., Zhou B. and Guo H., Minimum status, matching and domination of graphs. To appear in: Comp. J. (2020) 10.1093\/comjnl\/bxaa057."},{"key":"R23","doi-asserted-by":"crossref","first-page":"286","DOI":"10.13001\/1081-3810.2877","volume":"31","author":"Lin","year":"2016","journal-title":"Electron. J. Linear Algebra"},{"key":"R24","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":"R25","doi-asserted-by":"crossref","first-page":"2319","DOI":"10.1007\/s00373-014-1498-x","volume":"31","author":"Majstorovi\u0107","year":"2015","journal-title":"Graphs Combin"},{"key":"R26","first-page":"341","volume":"21","author":"Polansky","year":"1986","journal-title":"MATCH Commun. Math. Comput. Chem"},{"key":"R27","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1002\/net.21558","volume":"64","author":"Rissner","year":"2014","journal-title":"Networks"},{"key":"R28","doi-asserted-by":"crossref","first-page":"1425","DOI":"10.2298\/FIL1308425S","volume":"27","author":"Sedlar","year":"2013","journal-title":"Filomat"},{"key":"R29","first-page":"11","volume":"41","author":"\u0160olt\u00e9s","year":"1991","journal-title":"Math. Slovaca"},{"key":"R30","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":"R31","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\/2020015\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,2]],"date-time":"2021-03-02T09:28:28Z","timestamp":1614677308000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2020015"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":31,"alternative-id":["ro190326"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2020015","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}