Graph classes: a survey
Additive sparse spanners for graphs with bounded length of largest induced cycle
Theoretical Computer Science
Hi-index | 0.89 |
Let e"j denote the number of vertices of eccentricity j in a graph. We provide sharp lower bounds on e"j in graphs of given connectivity and in chordal graphs of given connectivity.