Super edge-graceful labelings of complete bipartite graphs

Let [n]* denote the set of integers [sic] if n is odd, and {- n/2,..., n/2} \ {0} if n is even. A super edge-graceful labeling f of a graph G of order p and size q is a bijection f : E(G) -> [q]*, such that the induced vertex labeling f* given by f*(u) = Sigma(uv is an element of) (E(G)) f(uv) is a bijection f* : V(G). [p]*. A graph is super edge-graceful if it has a super edge-graceful labeling. We show by construction that all complete bipartite graphs are super edge-graceful except for K-2,K-2, K-2,K-3, and K-1 ,K-n if n is odd.