SIGNED GRAPHS FROM PROPER COLORING OF GRAPHS

Let chi (G) denote the chromatic number of a graph G. Under the proper coloring of a graph G with chi (G) colors, we define a signed graph from it. The obtained signed graph is defined as parity colored signed graph and denoted as Sc. The signs of edges of G are defined from the colors of the vertices as +( - ) if the colors on the adjacent vertices are of the same (opposite) parity. In this paper, we initiate a study on Sc concerning proper coloring. . We further investigate the chromatic rna number of some classes of graphs