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
Magneto Hydrodynamic Convective Double Diffusive Fluid Flow Past a Vertical Plate with Varying Temperature and Concentration
This manuscript presents the influence of variable boundary of temperature and concentration of a double diffusive unsteady MHD natural convection heat and mass transfer flow past an accelerated vertical porous plate in...
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...
STABILITY ANALYSIS OF A NON-LINEAR HARVESTING MODEL WITH TAXATION
This paper formulates and analyzes a non-linear harvesting of prey, considered in a prey-predator system. Here, the effort is taken as a dynamic variable. Mathematical analysis of the model system includes the existence,...
Reliability Behaviour of a Two-State Stand by Redundant Power Plant under Arbitrary Failure Time Distribution
This paper presents the investigations for the evaluation of reliability of the power supply having been carried out with the help of Boolean function orthogonalization algorithm. The motive of the complex system is to s...
ON DIVISOR CORDIAL GRAPH
In this paper we prove that some known graphs such as the Herschel graph and some graphs constructed in this paper are divisor cordial graphs.