The notion of a prime labeling originated with Entringer and was introduced in a paper by Tout, Dabboucy and Howalla (1982). A graph with vertex set V is said to have a prime labeling if it its vertices are labeled with distinct integers 1, 2, ………..|V| such that for each edge uv the labels assigned to u and v are relatively prime. It is conjectured that all trees have a prime labeling. So far there has been little progress towards proving this conjecture. Among the classes of trees known to have prime labeling are : paths stars, caterpillars, complete binary tress, spiders, olive trees, all trees of order up to 50, palm trees, banana trees and binomial trees. In this work, we exhibit the Prime labeling of Lotus graph, Kite graph and Hn ʘ K1 graph.