Weak saturation number for multiple copies of the complete graph with a star removed

Let Kt denote the complete graph with t vertices, and let K1,m (a star with m edges) denote the complete bipartite graph with partite sets of sizes 1 and m. A graph G of order n is weaklyF-saturated if G contains no copy of F, and there is an ordering of the edges in E(Kn∖G) so that if they are added one at a time, then each edge added creates a new copy of F. In this paper, the weak saturation number of multiple copies of Kt−K1,m is determined for positive integers t and m(1≤m