Maximal independent set

In graph theory, a maximal independent set (MIS) or maximal stable set is an independent set that is not a subset of any other independent set. In other words, there is no vertex outside the independent set that may join it because it is maximal with respect to the independent set property. In graph theory, a maximal independent set (MIS) or maximal stable set is an independent set that is not a subset of any other independent set. In other words, there is no vertex outside the independent set that may join it because it is maximal with respect to the independent set property. For example, in the graph P 3 {displaystyle P_{3}} , a path with three vertices a {displaystyle a} , b {displaystyle b} , and c {displaystyle c} , and two edges a b {displaystyle ab} and b c {displaystyle bc} , the sets { b } {displaystyle {b}} and { a , c } {displaystyle {a,c}} are both maximally independent. The set { a } {displaystyle {a}} is independent, but is not maximal independent, because it is a subset of the larger independent set { a , c } {displaystyle {a,c}} . In this same graph, the maximal cliques are the sets { a , b } {displaystyle {a,b}} and { b , c } {displaystyle {b,c}} . A MIS is also a dominating set in the graph, and every dominating set that is independent must be maximal independent, so MISs are also called independent dominating sets. A graph may have many MISs of widely varying sizes; the largest, or possibly several equally large, MISs of a graph is called a maximum independent set. The graphs in which all maximal independent sets have the same size are called well-covered graphs. The phrase 'maximal independent set' is also used to describe maximal subsets of independent elements in mathematical structures other than graphs, and in particular in vector spaces and matroids. Two algorithmic problems are associated with MISs: finding a single MIS in a given graph and listing all MISs in a given graph. For a graph G = ( V , E ) {displaystyle G=(V,E)} , an independent set S {displaystyle S} is a maximal independent set if for v ∈ V {displaystyle vin V} , one of the following is true: The above can be restated as a vertex either belongs to the independent set or has at least one neighbor vertex that belongs to the independent set. As a result, every edge of the graph has at least one endpoint not in S {displaystyle S} . However, it is not true that every edge of the graph has at least one, or even one endpoint in S {displaystyle S} Notice that any neighbor to a vertex in the independent set S {displaystyle S} cannot be in S {displaystyle S} because these vertices are disjoint by the independent set definition.