CAHIT-8-EQUITABILITY OF CORONAS Cn○K1

Cahit [4] proposed the concept of labeling the vertices and edges among the set of integers {0,1,2,…….k-1} as evenly as possible to obtain a generalization of graceful labeling as follows: For any graph G(V,E) and any positive integer k, assign vertex labels from {0,1,2,…….k-1} so that when the edge labels are induced by the absolute value of the difference of the vertex labels, the number of vertices labeled with i and the number of vertices labeled with j differ by at most one and the number of edges labeled with i and the number of edges labeled with j differ by at most one. Cahit called a graph with such an assignment of labels k-equitable. We establish that Corona graphs Cn○K1 are k-equitable as per Cahit’s definition of k-equitability, k = 8