Editing Independent set (graph theory) (section)

===Maximal independent set===

{{Main|Maximal independent set}}

An independent set that is not a proper subset of another independent set is called ''maximal''. Such sets are [[dominating set]]s. Every graph contains at most 3<sup>''n''/3</sup> maximal independent sets,<ref>{{harvtxt|Moon|Moser|1965}}.</ref> but many graphs have far fewer.
The number of maximal independent sets in ''n''-vertex [[cycle graph]]s is given by the [[Perrin number]]s, and the number of maximal independent sets in ''n''-vertex [[path graph]]s is given by the [[Padovan sequence]].<ref>{{harvtxt|Füredi|1987}}.</ref> Therefore, both numbers are proportional to powers of 1.324718..., the [[plastic ratio]].