- A signed graph based on F is an ordinary graph F with each edge marked as positive or negative. Such a graph is called balanced if each of its cycles includes an even number of negative edges. We find the domination set on the vertices, on bipartite graphs and show that graphs has domination Number on signed graphs, such that a signed graph G may be converted into a balanced graph by changing the signs of d edges. We investigate the number D(F) defined as the largest d(G) such that G is a signed graph based on F. If F is the completebipartite graph with t vertices in each part, then D(f)≤ � t� - for some positive constant c.