Open irredundance and maximum degree in graphs Original Research Article

A necessary and sufficient condition for an open irredundant set of vertices of a graph to be maximal is obtained. This result is used to show that the smallest cardinality amongst the maximal open irredundant sets in an image-vertex isolate-free graph with maximum degree image is at least image for image, image for image and image for image. The bounds are the best possible.