| The cycle length distribution of a graph of order $n$ is $(c_1,c_2,\cdots,c_n)$, where $c_i$ is the number of cycles of length $i$. Let $A \subseteq E(K_{n,r})$. In this paper, we obtain the following results: (1) If $\mid A\mid =2$，and $n\leq r\leq \min \{n+6,2n-5\}$, then $G=K_{n,r}-A$ is determined by its cycle length distribution. (2) If $\mid A\mid =3$, and $ n\leq r \leq \min\{n+6,2n-7\}$, then $G=K_{n,r}-A$ is also determined by its cycle length distribution. |
