SKOLEM DIFFERENCE LUCAS MEAN LABELLING FOR SOME SPECIAL GRAPHS
Journal Title: Bulletin of Pure and Applied Sciences Sec. E - Mathematics and Statistics - Year 2018, Vol 37, Issue 2
Abstract
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.
Authors and Affiliations
A. Ponmoni
Keywords
Related Articles
- EP ID EP531773
- DOI 10.5958/2320-3226.2018.00041.3
- Views 149
- Downloads 0
EFFECT OF VARYING THERMAL CONDUCTIVITY AND VISCOSITY IN UNSTEADY FREE STREAM FLOW OVER STRETCHING SHEET
The aim of this paper is to investigate two dimensional unsteady flow of a viscous incompressible fluid about stagnation point on stretching sheet in the presence of time dependent free stream velocity. It is assumed tha...
WIENER INDEX OF PHYSIO-CHEMICAL LABELED GRAPH
In this paper by the term Wiener Lower sum we mean the Wiener index. Mathematically, the Wiener index of a graph is defined as the sum of distances between all pairs of vertices in a connected graph. Here we obtain the...
MAHLER MEASURE OF CHARGED GRAPHS OVER THE PURE CUBIC FIELD Q ( )
In this paper, the algebraic integer as a edge label from the pure cubic field to the all vertices of the simple graphs thereafter charges to all the vertices and get the edge labeled charged graphs. Further to find the...
A STUDY ON THE EFFECTIVE EDGES IN THE CARTESIAN PRODUCT OF FUZZY GRAPHS
In this paper we discuss the number of effective edges in the Cartesian product of fuzzy graphs. Some basic theorems and results are obtained on effective edges. Based on the results we find the effective edge domination...
Restricted Constraints in a Max-Flow and Min-Cost problem
The present paper defines a combination of two most important and old flow problems such as maximum flow and minimum cost flow. In the first one a flow with the maximum value from source node to sink node is sought. The...