In this paper, we introduce a new labeling called strongly odd prime labeling. A graph G with vertex set  is said to have an odd prime labeling if there exists an injective function

such that for every edge   and  are relatively prime. A graph G that admits an odd prime labeling is called an odd prime graph and a graph is said to be strongly odd prime graph if for each vertex v of G, there exists an odd prime labeling, f satisfying  In the present work, we investigate some results for strongly odd primality of some path related graphs.

prime labeling, odd prime labeling, strongly prime labeling, strongly odd prime labeling.