Let G = K-m,K-n-m be a complete bipartite graph on [n] with n - m & GE; m and J(G) its binomial edge ideal in the polynomial ring S = K[x(1), . . . , x(n), y(1), . . . , y(n)] over a field K. For any t & GE; 2, it is proved that depth(S/J(G)(t)) is equal to n + 1 if m = 1 and 4 if m & GE; 2.