Independent set (graph theory)

（重定向自Independence number）

The nine blue vertices form a maximum independent set for the Generalized Petersen graph GP(12,4).

In graph theory, an independent set or stable set is a set of vertices in a graph, no two of which are adjacent. That is, it is a set S of vertices such that for every two vertices in S, there is no edge connecting the two. Equivalently, each edge in the graph has at most one endpoint in S. The size of an independent set is the number of vertices it contains. Independent sets have also been called internally stable sets.

单词	Independence number
释义	Independence number 英语百科 Independent set (graph theory) （重定向自Independence number） In graph theory, an independent set or stable set is a set of vertices in a graph, no two of which are adjacent. That is, it is a set S of vertices such that for every two vertices in S, there is no edge connecting the two. Equivalently, each edge in the graph has at most one endpoint in S. The size of an independent set is the number of vertices it contains. Independent sets have also been called internally stable sets.
随便看	Emberizidae的意思 emberizidaes的意思 emberizids的意思 emberizine的意思 emberless的意思 emberley的意思 emberling的意思 Emberlynn的意思 embers的意思 Emberton的意思 embertons的意思 Ember Week的意思 embery的意思 embeth的意思 embetter的意思 embetterment的意思 Embezzlar的意思 embezzle的意思 embezzle的意思 embezzled funds的意思 embezzle from的意思 embezzlement的意思 embezzlement and theft的意思 embezzlement of cash的意思 embezzlement of estates的意思