Eccentric counts, connectivity and chordality

Let ejej denote the number of vertices of eccentricity j   in a graph. We provide sharp lower bounds on ejej in graphs of given connectivity and in chordal graphs of given connectivity.

► Let ejej denote the number of vertices of eccentricity j   in a graph.
► We provide sharp lower bounds on ejej in graphs of given connectivity.
► We prove sharp lower bounds on ejej in chordal graphs of given connectivity.