Well irredundant graphs Original Research Article

A vertex x in a subset X of vertices of a graph is redundant if its closed neighbourhood is contained in the union of closed neighbourhoods of vertices of X − x. This paper describes the structure of bipartite graphs, chordal graphs and graphs of girth at least five in which every maximal set of vertices having no redundancies is maximum.