Abstract
The minimum status (or its normalized version called proximity) is a well-known concept in communication network theory. We determine the trees minimizing the minimum status among trees with a given degree sequence, and we show that the trees maximizing the minimum status among trees with a given degree sequence must be caterpillars with specific properties.





Similar content being viewed by others
References
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
Aouchiche, M., Hansen, P.: Proximity and remoteness in graphs: results and conjectures. Networks 58(2), 95–102 (2011). https://doi.org/10.1002/net.20450
Aouchiche, M., Hansen, P.: Nordhaus–Gaddum relations for proximity and remoteness in graphs. Comput. Math. Appl. 59(8), 2827–2835 (2010). https://doi.org/10.1016/j.camwa.2010.02.001
Aouchiche, M., Hansen, P.: Proximity, remoteness and girth in graphs. Discrete Appl. Math. 222, 31–39 (2017). https://doi.org/10.1016/j.dam.2017.01.025
Bıyıkoǧlu, 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
Brandes, U.: Central positions in social networks. In: Fernau, G. (ed.) Computer Science—Theory and Applications—15th International Computer Science Symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29–July 3, 2020, Proceedings, volume 12159 of Lecture Notes in Computer Science, pp. 30–45. Springer (2020). https://doi.org/10.1007/978-3-030-50026-9_3
Buckley, F., Harary, F.: Distance in Graphs. Addison-Wesley Publishing Company, Redwood City (1990)
Dankelmann, P.: Proximity, remoteness and minimum degree. Discrete Appl. Math. 184, 223–228 (2015). https://doi.org/10.1016/j.dam.2014.11.012
Freeman, L.C.: Centrality in social networks conceptual clarification. Soc. Netw. 1(3), 215–239 (1978/1979). https://doi.org/10.1016/0378-8733(78)90021-7
Golbeck, J.: Analyzing the Social Web, pp. 25–44. Morgan Kaufmann, Burlington (2013)
Goldman, A.J.: Optimal center location in simple networks. Transp. Sci. 5(2), 212–221 (1971). https://doi.org/10.1287/trsc.5.2.212
Kang, A.N.C., Ault, D.A.: Some properties of a centroid of a free tree. Inf. Process. Lett. 4(1), 18–20 (1975). https://doi.org/10.1016/0020-0190(75)90055-1
Liang, C., Zhou, B., Guo, H.: Minimum status, matching and domination of graphs. Comput. J. 64(9), 1384–1392 (2021). https://doi.org/10.1093/comjnl/bxaa057
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–161 (2012). https://doi.org/10.1007/s10878-011-9412-4
Lin, H., Zhou, B.: Which numbers are status differences? Appl. Math. Comput. 399, 126004 (2021). https://doi.org/10.1016/j.amc.2021.126004
Ma, B., Wu, B., Zhang, W.: Proximity and average eccentricity of a graph. Inf. Process. Lett. 112(10), 392–395 (2012). https://doi.org/10.1016/j.ipl.2012.02.001
Peng, Z., Zhou, B.: Minimun status of trees with given parameters. RAIRO Oper. Res. 55, S765–S785 (2021). https://doi.org/10.1051/ro/2020015
Rissner, R., Burkard, R.E.: Bounds on the radius and status of graphs. Networks 64(2), 76–83 (2014). https://doi.org/10.1002/net.21558
Sedlar, J.: Remoteness, proximity and few other distance invariants in graphs. Filomat 27(8), 1425–1435 (2013)
Vukičević, D., Caporossi, G.: Network descriptors based on betweenness centrality and transmission and their extremal values. Discrete Appl. Math. 161(16–17), 2678–2686 (2013). https://doi.org/10.1016/j.dam.2013.04.005
Wang, H.: The extremal values of the Wiener index of a tree with given degree sequence. Discrete Appl. Math. 156(14), 2647–2654 (2008). https://doi.org/10.1016/j.dam.2007.11.005
Zelinka, B.: Medians and peripherians of a tree. Arch. Math. 4(2), 87–95 (1968)
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–644 (2008)
Acknowledgements
The authors thank the editor and the referees for very helpful and constructive comments and suggestions on early versions. This work was supported by National Natural Science Foundation of China (No. 12071158).
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Guo, H., Zhou, B. Minimum status of trees with a given degree sequence. Acta Informatica 60, 1–10 (2023). https://doi.org/10.1007/s00236-022-00416-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00236-022-00416-2