*Associate Professor, Govt Arts College, Chidambaram-608 102, India
**Assistant Professor, S.R.M University, Chennai-603 203, India
Online published on 19 April, 2016.
A graph G=(V,E) with n vertices is said to admit prime labeling if its vertices can be labeled with distinct positive integers not exceedingsuch that the label of each pair of adjacent vertices are relatively prime. A graph G which admits prime labeling is called a prime graph and a graph G is said to be a strongly prime graph if for any vertex v of G there exists a prime labeling f satisfying fv =1. In the present work we investigate some classes of graphs and subdivision of some classes of graphs which admit strongly prime labeling.
Graph labeling, prime labeling, prime graph, strongly prime graph
