independent set and independence number
A set of vertices in a graph is called an independent set if there are no edges between the vertices.
The independence number of a graph , usually denoted by , is the size of a maximal independent set in . means that there are vertices with no edges between them.
An independent set is sometimes called a stable set or an anticlique.
|Title||independent set and independence number|
|Date of creation||2013-03-22 14:30:06|
|Last modified on||2013-03-22 14:30:06|
|Last modified by||rspuzio (6075)|