In a simple graph, n, δ, i and IR denote respectively the number of vertices, the minimum degree, the order of a minimum maximal independent set and the order of a maximum irredundant set. We show that , which was conjectured by Cockayne, Favaron, Payan and Thomason, and that .