| Issue |
RAIRO-Oper. Res.
Volume 55, 2021
Regular articles published in advance of the transition of the journal to Subscribe to Open (S2O). Free supplement sponsored by the Fonds National pour la Science Ouverte
|
|
|---|---|---|
| Page(s) | S765 - S785 | |
| DOI | https://doi.org/10.1051/ro/2020015 | |
| Published online | 02 March 2021 | |
Minimum status of trees with given parameters
School of Mathematical Sciences, South China Normal University, Guangzhou 510631, P.R. China
* Corresponding author: zhoubo@scnu.edu.cn
Received:
29
September
2019
Accepted:
12
February
2020
The status of a vertex v in a connected graph G is defined as the sum of the distances from v to all other vertices in G. The minimum status of G is the minimum of status of all vertices of G. 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.
Mathematics Subject Classification: 05C12 / 05C35 / 05C90
Key words: Minimum status / closeness centrality / diameter / pendant vertices / odd vertices / series-reduced trees
© EDP Sciences, ROADEF, SMAI 2021
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.