Graphs with isolation number equal to one third of the order

Magdalena Lemanska, Mercè Mora, María José Souto-Salorio

A set $D$ of vertices of a graph $G$ is isolating if the set of vertices not in $D$ or with no neighbor in $D$ is independent. The isolation number of $G$, denoted by $\iota (G)$, is th…