Noorul Islam University,

Abstract: Let) be a graph of orde n and s m. A e-labeling of G is a one-to-one},...,2, m that induces a l},...,3,2 2m of t edges of G def |)]( [ 2vf − for every edge uv of G. The value of a e-labeling is denote)(uvf +. The maximum value of a e-l eling of G is defined b e-valmax ( G) = max { val ( f) : f is a labeling of G}, while the minimum value of e-labeling of G is de ned by e-valmin ( ) = in{e-val ( f) : f is a e-labeling of G}. In this paper, we investigate the e-valmin ( ) and e-va x(G) of ath nP nC, star K a, ( EVG,0{)(G → ined by f + d by e-val r ize abe