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.
机构:
Univ TorontoBahen Ctr, Dept Math, 40 St George St, Toronto, ON M5S 2E4, CanadaUniv TorontoBahen Ctr, Dept Math, 40 St George St, Toronto, ON M5S 2E4, Canada
Avvakumov, Sergey
论文数: 引用数:
h-index:
机构:
Balitskiy, Alexey
Hubard, Alfredo
论文数: 0引用数: 0
h-index: 0
机构:
Univ Gustave Eiffel, CNRS, LIGMF, F-77454 Marne La Vallee, FranceUniv TorontoBahen Ctr, Dept Math, 40 St George St, Toronto, ON M5S 2E4, Canada
Hubard, Alfredo
Karasev, Roman
论文数: 0引用数: 0
h-index: 0
机构:
Inst Informat Transmiss Problems RAS, Bolshoy Karetny 19, Moscow 127994, RussiaUniv TorontoBahen Ctr, Dept Math, 40 St George St, Toronto, ON M5S 2E4, Canada
Karasev, Roman
Karasev, Roman
论文数: 0引用数: 0
h-index: 0
机构:
Inst Informat Transmiss Problems RAS, Bolshoy Karetny 19, Moscow 127994, RussiaUniv TorontoBahen Ctr, Dept Math, 40 St George St, Toronto, ON M5S 2E4, Canada