The eccentricity of a vertex v in a graph is the maximum of the distances from v to all other vertices. The diameter of a graph is the maximum of the eccentricities of its vertices. Fix the parameters n, d, c. Over all graphs with order n and diameter d, we determine the maximum (within 1) and the minimum of the number of vertices with eccentricity c.
机构:
Huaiyin Inst Technol, Fac Math & Phys, Huaian 223003, Jiangsu, Peoples R ChinaHuaiyin Inst Technol, Fac Math & Phys, Huaian 223003, Jiangsu, Peoples R China