SKOLEM DIFFERENCE LUCAS MEAN LABELLING FOR SOME SPECIAL GRAPHS

摘要

A graph G with p vertices and q edges is said to have Skolem difference Lucas mean labelling if it is possible to label the vertices x ∈v with distinct elements f(x) from the set {1,2,..., L_(p+q)} in such a way that the edge e = uv is labelled with |f(u)-f(v)/2| if |f(u) - f(v)| is even and |f(u)-f(v|+1/2 if |f(u) - f(v)| is odd, then the resulting edge labels are distinct and are from {L_1,L_2,...,L_q}. A graph that admits Skolem difference Lucas mean labelling is called a Skolem difference Lucas mean graph. In this paper, we prove for some graphs such as triangular snake graph TS_n,The triangular snake C_2(P_n), Umbrella U(m, n), F_m ⊕K_(1,n)~+,F_n~(t),F_n~+ are Skolem difference Lucas mean graph.