Some New Results on Prime Graphs

Vaidya, Samir K.; Prajapati, Udayan M.

dc.contributor.author	Vaidya, Samir K.
dc.contributor.author	Prajapati, Udayan M.
dc.date.accessioned	2018-06-08T14:03:30Z
dc.date.available	2018-06-08T14:03:30Z
dc.date.issued	2012-07
dc.identifier.citation	Open Journal of Discrete Mathematics, 2012, 2, 99-104	en_US
dc.identifier.uri	http://dx.doi.org/10.4236/ojdm.2012.23019
dc.identifier.uri	http://hdl.handle.net/123456789/1513
dc.description.abstract	We 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.	en_US
dc.language.iso	en	en_US
dc.publisher	Scientific Research	en_US
dc.subject	Prime Labeling	en_US
dc.subject	Prime Graph	en_US
dc.subject	Strongly Prime Graph	en_US
dc.title	Some New Results on Prime Graphs	en_US
dc.type	Article	en_US