Some New Results on Prime Graphs

Simple item page
dc.contributor.authorVaidya, Samir K.
dc.contributor.authorPrajapati, Udayan M.
dc.date.accessioned2018-06-08T14:03:30Z
dc.date.available2018-06-08T14:03:30Z
dc.date.issued2012-07
dc.description.abstractWe 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.identifier.citationOpen Journal of Discrete Mathematics, 2012, 2, 99-104en_US
dc.identifier.urihttp://dx.doi.org/10.4236/ojdm.2012.23019
dc.identifier.urihttp://hdl.handle.net/123456789/1513
dc.language.isoenen_US
dc.publisherScientific Researchen_US
dc.subjectPrime Labelingen_US
dc.subjectPrime Graphen_US
dc.subjectStrongly Prime Graphen_US
dc.titleSome New Results on Prime Graphsen_US
dc.typeArticleen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
OJDM20120300007_69764759.pdf
Size:
538.04 KB
Format:
Adobe Portable Document Format
Description:
Full text
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Physics & Mathematics