A Study on Some Aspects of Graph Coloring on a Class of Graphs

Abstract

Graph coloring problems is one of the important concepts of graph theory which arise in real life. It is labelling of graph components such as vertices, edges and regions under some conditions. A Nand#8722; sum graphs G is a graph if its nodes can be assigned with distinct natural number such that e = uv is an edge of G iff the addition of two nodes u and v is also a nodes in G. An integral sum graph G+(S) is defined just as the sum graph, the difference being that S and#8834; Z instead of S and#8834; N