Abstract
Two classical concepts of centrality in a graph are the median and the center. The connected notions of the status and the radius of a graph seem to be in no relation. In this article, however, we show a clear connection of both concepts, as they obtain their minimum and maximum values at the same type of tree graphs. Trees with fixed maximum degree and extremum radius and status, respectively, are characterized. The bounds on radius and status can be transferred to general connected graphs via spanning trees. A new method of proof allows not only to regain results of Lin et al. on graphs with extremum status, but it allows also to prove analogous results on graphs with extremum radius. © 2014 Wiley Periodicals, Inc. NETWORKS, Vol. 64(2), 76–83 2014
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
