Bounds on the size of graphs of given order and

The l-connectivity ϰ/(G) of a graph G of order p ⩾ l − 1 is the minimum number of vertices that are required to be deleted from G to produce a graph with at least l components or with fewer than l vertices. Extremal graphs are investigated and bounds established on the number of edges in graphs of given order and l-connectivity.