The maximal irredundance polynomial 
for the graph 
may be defined as the polynomial
 |
where 
is the (lower) irredundance number, 
is upper irredundance
number, and the coefficient 
of 
is the number of maximal
irredundant sets in the graph 
.
