Let G = (V, E) be a graph. An injective function f: V→N is said to be a Zumkeller labeling of the graph G, if the induced function f *: E → N defined as f * (xy) = f(x) f (y) is a Zumkeller number for all xy ∈ E, x, y ∈ V.A graph G= (V, E) that admits a Zumkeller labeling is called a Zumkeller graph. In this paper, we provide polynomial time algorithms for Zumkeller labeling of complete bipartite graphs and wheel graphs. © Springer India 2015.