Zaib Hassan Niazi¹, Muhammad Awais Tariq Bhatti², Muhammad Aslam², Yasir Qayyum², Muhammad Ibrahim¹, Ather Qayyum^2,

Consider as labeling of graph ’s vertices. The weight for vertex x is specified as where shows the vertex x’s degree, shows the u’s open neighborhood and λ(y) shows the label for vertex y. In [1] M. Miller et al. define d-lucky labeling that is similar to the graph vertex coloring. The labeling λ is said to be d−lucky labeling of graph G if for each adjacent pair of vertices x and y in G. The least positive integer n such that G has a d-lucky labeling with {1, 2, ..., n} as the set of labels is known as d -lucky number of a graph G represented as In this paper we investigated the d-lucky number for jelly fish graph, coconut tree, kite graph, complete binary tree and generalized theta graph.

lucky labeling, d -lucky labeling, jelly fish graph, coconut tree, kite graph, complete binary tree, generalized theta graph