Graphic Sequences with an A-Connected Realization

A non-increasing sequence \({\pi = (d_1, d_2, \ldots, d_n)}\) of non-negative integers is said to be graphic if it is the degree sequence of a simple graph G on n vertices. Let A be an (additive) abelian group. An extremal problem for a graphic sequence to have an A-connected realization is considered as follows: determine the smallest even integer \({\sigma (A, n)}\) such that each graphic sequence \({\pi = (d_1, d_2, \ldots, d_n)}\) with d _n ≥ 2 and \({\sigma (\pi) = d_1 + d_2 + \cdots +d_n \ge \sigma (A, n)}\) has an A-connected realization. In this paper, we determine \({\sigma (A, n)}\) for |A| ≥ 5 and n ≥ 3.