A graph ( ( ( is said to have a prime labeling if its vertices can be labeled with distinct positive integers, such that the label of each pair of adjacent vertices are relatively prime. A graph which admits prime labeling is called a prime graph and a graph is said to be strongly prime graph if for any vertex, of there exists a prime labeling, satisfying ( In this paper we investigate strongly prime labeling of some graphs.