A non-increasing sequence of non-negative integers is said to be graphic if it is the degree sequence of a simple graph on vertices. Let be an (additive) Abelian group. An extremal problem for a graphic sequence to have an -connected realization is considered as follows: determine the smallest even integer such that each graphic sequence with and has an -connected realization. In this paper, we determine for .