Let sigma(G)=SIGMA(i=0)ka(i)sigma(k-i) the sigma-polynomial of a graph
G. We ask the question: When k and a1 are given, what is the largest
possible value of a(i)(0 less-than-or-equal-to i less-than-or-equal-to
k) for any graph G? In this paper, this question is answered and the
extremal graphs are characterized. So, the results in [3,6] are genera
lized.