ON EQUITABLE CHROMATIC NUMBER OF TADPOLE GRAPHTm;n

Abstract

Graph coloring is a special case of graph labeling. Proper vertexk-coloring of a graph Gis to color all the vertices of a graph with di§erentcolors in such a way that no two adjacent vertices are assigned with the samecolor. In a vertex coloring of G, the set of vertices with the same color iscalled color class. An equitable k-coloring of a graph G is a proper k-coloringin which any two color classes di§er in size by atmost one. In this paper wegive results regarding the equitable coloring of central, middle, total and linegraphs of Tadpole graph which is obtained by connecting a cycle graph and apath graph with a bridge.