圖形G =（V, E）中之獨立集為點集V之一子集合S，且使得S中任兩點在G中均不相連。圖形G中之最大連通子圖形稱之連通元件。在本篇論文中，我們確定了k-連通元件圖形中獨立集之第一及第二大數值。除此之外，我們亦描繪出達到這些數值之極圖。

In a graph G = (V; E), an independent set is a subset S of V (G) such that no two vertices in S are adjacent. A maximal connected subgraph of G is called a component of G. In this paper, we study the problem of determining the largest and the second largest numbers of independent sets among all graphs with k ≥ 2 components. Extremal graphs achieving these values are also given.