{"references": ["1.\tJ. A. Bondyand U.S.R. Murthy, \u201cGraph Theory and Applications\u201d, (North-Holland).New York (1976).", "2.\tA. Tout, A.N. Dabboucy and K. Howalla, \u201cPrime labeling of graphs\u201d, Nat.Acad.Sci. Letters, 11 (1982) 365-368.", "3.\tS. M. Lee, L. Wui, and J. Yen, \u201con the amalgamation of prime graphs Bull\u201d, MalaysianMath.Soc. (Second Series)11, (1988) 59-67.", "4.\tT. O. Dretskyetal, \u201con Vertex Prime labeling of graphs in graph theory\u201d, Combinatories and applications, Vol. 1, J. Alari (Wiley. N.Y.1991) 299-359.", "5.\tH. C. Fuand K.C. Huany, \u201con prime labeling Discrete Math\u201d, 127, (1994) 181-186.", "6.\tM. Sundaram, R. Ponraj& S. Somasundaram (2006), \u201con prime labeling conjecture\u201d, Ars Combinatoria 79 205-209.", "7.\tJ.A. Gallian, \u201cA dynamic survey of graph labeling\u201d, The Electronic Journal of Combinations 16 #DS6 (2009).", "8.\tS.K. Vaidya and K. K. Kanmani, \u201cPrime labeling for some cycle related graphs\u201d, journal of Mathematics Research, Vol.2. No.2, May(2010) 98-104.", "9.\tS. Meena and K. Vaithilingam, \u201cPrime Labeling for some Helm related graphs\u201d, International journal of Innovative Research in Science, Engineering and Technology Vol.2,issue 4, (2013)."]}

A graph with vertex set is said to have a prime labeling if its vertices are labeled with distinct integers such that for each the labels assigned to and are relatively prime. A graph which admits prime labeling is called a prime graph.In this paper, we investigate prime labeling of Herschel graph. We also discuss prime labeling in the context of some graph operations namely Fusion, Duplication, Switching and Path union