The design spectrum of the Shrikhande graph

The design spectrum of a simple graph G is the set of positive integers n such that there exists an edgewise decomposition of the complete graph Kₙ into $n(n - 1)/(2 |E(G)|)$ copies of G. The purpose of this short paper is to prove that the Shrikhande graph and the line graph of K4,4 have the design spectrum \96t + 1: t = 1, 2, \.