A \(\mathcal{Y}\) tree on \(k\) vertices is denoted by \(\mathcal{Y}_k\). To decompose a graph into \(\mathcal{Y}_k\) trees, it is necessary to create a collection of subgraphs that are isomorphic to \(\mathcal{Y}_k\) tree and are all distinct. It is possible to acquire the necessary condition to decompose \(K_m(n)\) into \(\mathcal{Y}_k\) trees (\(k \geq 5\)), which has been obtained as \(n^2m(m-1) \equiv 0 \pmod{2(k-1)}\). It has been demonstrated in this document that, a gregarious \(\mathcal{Y}_5\) tree decomposition in \(K_m(n)\) is possible only if \(n^2m(m-1) \equiv 0 \pmod{8}\).