d = independenceNumber G
This function returns the maximum number of independent vertices in a graph. This number can be found by computing the dimension of the simplicial complex whose faces are the independent sets (see independenceComplex) and adding 1 to this number.
|
|
|
|
|
|
The object independenceNumber is a method function.
The source of this document is in /build/reproducible-path/macaulay2-1.25.05+ds/M2/Macaulay2/packages/EdgeIdeals.m2:2960:0.