Abstract
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.
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.
