1Department of Mathematics, C.S.I. College of Engineering, Ketti-643215, Tamilnadu, India. E-mail: ponmonirpj@gmail.com
2Department of Mathematics, V.O.C. College, Tuticorin-628008, Tamilnadu, India. E-mail: snk.voc@gmail.com
3Department of Mathematics, V.O.C. College, Tuticorin-628008, Tamilnadu, India. E-mail: nagarajan.voc@gmail.com
*Corresponding Author: A. Ponmoni, Department of Mathematics, C.S.I. College of Engineering, Ketti-643215, Tamilnadu, India, E-mail: ponmonirpj@gmail.com
AMS subject classification: 05C78.
A graph G with p vertices and 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, …, Lp+q}, in such a way that the edge e= is labelled with if |f(u) − f(v)| is even and if |(u) − f(v)| is odd, then the resulting edge labels are distinct and are from, {L1, L2,….Lq},. 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, TSN The triangular snake C2(Pn) Umbrella U(m, n), Fm ⊕ K1, n+, Fn(t), Fn+ are Skolem difference Lucas mean graph.
Skolem Mean Labelling, Skolem difference Mean Labelling, Skolem difference Lucas Mean Labelling
