Macaulay2 » Documentation
Packages » Graphs :: independenceNumber
next | previous | forward | backward | up | index | toc

independenceNumber -- computes the independence number of a graph



The independence number of a graph G is the maximum number of vertexSet in any independent set of G.

i1 : G = graph({{1,2},{2,3},{3,4},{4,5}},EntryMode=>"edges");
i2 : independenceNumber G

o2 = 3

See also

Ways to use independenceNumber :

For the programmer

The object independenceNumber is a method function.