R. Malathi and A. Alwin investigate the concept of domination number on balanced signed graphs. They define a signed graph as an ordinary graph where each edge is marked as positive or negative, and is balanced if each cycle contains an even number of negative edges. The paper finds domination sets on the vertices of bipartite graphs and shows that changing the signs of d edges can convert a signed graph G into a balanced graph. It also investigates the number D(F) as the largest d(G) where G is a signed graph based on F. The paper concludes that if F is a complete bipartite graph with t vertices in each part, then D(F) is at most 1/2t^2 -