Decompositions of \(\lambda K_{n}\), into \(S(4,3)\)’s

A Stanton-type graph \( S(n, m) \) is a connected multigraph on \( n \) vertices such that for a fixed integer \( m \) with \( n – 1 \leq m \leq \binom{n}{2} \), there is exactly one edge of multiplicity \( i \) (and no others) for each \( i = 1, 2, \ldots, m \). In a recent paper, the authors decomposed \( \lambda K_{n} \) (for the appropriate minimal values of \( \lambda \)) into two of the four possible types of \( S(4, 3) \)’s. In this note, decompositions of \( \lambda K_{n} \) (for the appropriate minimal values of \( \lambda \)) into the remaining two types of \( S(4, 3) \)’s are given.