Open Access
Issue |
RAIRO-Oper. Res.
Volume 56, Number 1, January-February 2022
|
|
---|---|---|
Page(s) | 415 - 430 | |
DOI | https://doi.org/10.1051/ro/2022010 | |
Published online | 14 February 2022 |
- M. Aouchiche and P. Hansen, Proximity and remoteness in graphs: results and conjectures. Networks 58 (2011) 95–102. [Google Scholar]
- M. Aouchiche and P. Hansen, Proximity, remoteness and distance eigenvalues of a graph. Discrete Appl. Math. 213 (2016) 17–25. [CrossRef] [MathSciNet] [Google Scholar]
- M. Aouchiche and P. Hansen, Proximity, remoteness and girth in graphs. Discrete Appl. Math. 222 (2017) 31–39. [CrossRef] [MathSciNet] [Google Scholar]
- F. Buckley and F. Harary, Distance in Graphs. Addison-Wesley Publishing Company, Redwood City, CA (1990). [Google Scholar]
- M. Cheng, H. Lin and B. Zhou, Minimum status of series-reduced trees with given parameters. Bull. Braz. Math. Soc. (N.S.) (2021) DOI: 10.1007/s00574-021-00278-1. [Google Scholar]
- A.A. Dobrynin and R. Sharafdini, Stepwise transmission irregular graphs. Appl. Math. Comput. 371 (2020) 124949. [MathSciNet] [Google Scholar]
- K. Durant and S. Wagner, On the centroid of increasing trees. Discrete Math. Theor. Comput. Sci. 21 (2019) Paper 8. [Google Scholar]
- A.N.C. Kang and D.A. Ault, Some properties of a centroid of a free tree. Information Process. Lett. 4 (1975) 18–20. [CrossRef] [Google Scholar]
- C. Liang, B. Zhou and H. Guo, Minimum status, matching and domination of graphs. Comput. J. 64 (2021) 1384–1392. [CrossRef] [MathSciNet] [Google Scholar]
- H. Lin and B. Zhou, Which numbers are status differences?. Appl. Math. Comput. 399 (2021). [Google Scholar]
- C. Lin, W.H. Tsai, J.L. Shang and Y.J. Zhang, Minimum statuses of connected graphs with fixed maximum degree and order. J. Comb. Optim. 24 (2012) 147–161. [CrossRef] [MathSciNet] [Google Scholar]
- Z. Peng and B. Zhou, Minimun status of trees with given parameters. RAIRO. Oper. Res. 55 (2021) S765–S785. [CrossRef] [EDP Sciences] [Google Scholar]
- K. Pravas and A. Vijayakumar, The median problem on k-partite graphs. Discuss. Math. Graph Theory 35 (2015) 439–446. [CrossRef] [MathSciNet] [Google Scholar]
- P. Qiao and X. Zhan, The relation between the number of leaves of a tree and its diameter. Czechoslovak Math. J. (2021). DOI: 10.21136/CMJ.2021.0492-20. [Google Scholar]
- R. Rissner and R.E. Burkard, Bounds on the radius and status of graphs. Networks 64 (2014) 76–83. [Google Scholar]
- J. Sedlar, Remoteness, proximity and few other distance invariants in graphs. Filomat 27 (2013) 1425–1435. [Google Scholar]
- P.J. Slater, Centers to centroids in graphs. J. Graph Theory 2 (1978) 209–222. [CrossRef] [MathSciNet] [Google Scholar]
- H. Smith, L. Székely, H. Wang and S. Yuan, On different “middle parts” of a tree. Electron. J. Combin. 25 (2018) Paper 3.17. [CrossRef] [Google Scholar]
- D. Vukičević and G. Caporossi, Network descriptors based on betweenness centrality and transmission and their extremal values. Discrete Appl. Math. 161 (2013) 2678–2686. [CrossRef] [MathSciNet] [Google Scholar]
- H. Wang, Centroid, leaf-centroid, and internal-centroid. Graphs Combin. 31 (2015) 783–793. [CrossRef] [MathSciNet] [Google Scholar]
- B. Zelinka, Medians and peripherians of trees. Arch. Math. (Brno) 4 (1968) 87–95. [Google Scholar]
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.