Total Edge Lucas Irregular Labeling For Some Cycle Related Graphs

Let G= (V, E) be a (p, q) – graph. A total edge Lucas irregular labeling f:V(G)UE(G)  → {1,2,3, … . ,a} graph G=(V,E) is a labeling of vertices and edges of G in such a way that for any different edges xy and x’y’ their weights f(x)+f(xy)+f(y) and f(x’)+f(x’y’)+f(y’) are distinct Lucas numbers. The total edge Lucas irregularity strength, tels (G), is defined as the minimum K for which G has a total edge Lucas irregular labeling. In this paper, we prove that the graphs such as C_m @P_n,C_m@k_1,n,C_m@2P_nand C_n⊙k₁  admit the total edge Lucas irregular labeling.