Minimum Status of Series-Reduced Trees with Given Parameters

摘要

For a vertex v of a connected graph G, the status of v 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 largest values for the minimum status of series-reduced trees with fixed parameters such as maximum degree, number of pendant vertices, diameter, matching number and domination number, and characterize the unique extremal trees.

关键词