We give lower bounds on the size and total of clique partitions a graph in terms its spectral radius minimum degree, derive upper bound for maximum number edge-disjoint $t$-cliques. The extremal graphs attaining are exactly block Steiner $2$-designs regular with $K_t$-decompositions, respectively.
