1 paper
C. M. Mynhardt, A. Roux
A set D of vertices of a graph G with vertex set V is irredundant if each non-isolated vertex of G[D] has a neighbour in V-D that is not adjacent to any other vertex in D. The uppe…