Abstract
Concepts which measure the centrality of a vertex in a graph (eccentricity, distance and branch weight) are extended to paths in a graph. Locating paths with minimum eccentricity and distance, respectively, may be viewed as multicenter and multimedian problems, respectively, where the facilities are located on vertices that must constitute a path. The third problem is to find a path P in a graph for which the number of vertices in the largest component of G-P is minimized. The relationships among these concepts are studied. Most of the results presented are for trees, and, in particular, linear algorithms for finding paths in trees of minimum eccentricity and of minimum branch weight are presented. These problems arise in determining a “most accessible” linear route in a network according to several plausible criteria.
Sign-in/Register to access full text options 
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.
