Vaidya, Samir K.Prajapati, Udayan M.2018-06-082018-06-082012-07Open Journal of Discrete Mathematics, 2012, 2, 99-104http://dx.doi.org/10.4236/ojdm.2012.23019http://hdl.handle.net/123456789/1513We investigate prime labeling for some graphs resulted by identifying any two vertices of some graphs. We also introduce the concept of strongly prime graph and prove that the graphs Cn, Pn, and K1,n are strongly prime graphs. Moreover we prove that Wn is a strongly prime graph for every even integer n ≥ 4.enPrime LabelingPrime GraphStrongly Prime GraphArticle