Abstract
This paper examines E-optimality of designs which have the cubic association scheme and which are regular graph designs. The instances in which the minimum non-zero eigenvalues of the information matrices for such designs are sufficiently large to permit E-optimality are given.