TOPICS
Search

Maximal Independence Polynomial


The maximal independence polynomial I_G(x) for the graph G may be defined as the polynomial

 I_G(x)=sum_(k=i(G))^(alpha(G))s_kx^k,

where i(G) is the lower independence number, alpha(G) is the (upper) independence number, and the coefficient s_k of x_k is the number of maximal independent vertex sets in the graph G.


See also

Independence Number, Independent Vertex Set, Lower Independence Number, Maximal Independent Vertex Set

Explore with Wolfram|Alpha

WolframAlpha

More things to try:

Cite this as:

Weisstein, Eric W. "Maximal Independence Polynomial." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/MaximalIndependencePolynomial.html

Subject classifications