Prime labeling originated with Entringer and was introduced by Tout, Dabboucy and Howalla4. A Graph G(V,E) is said to have a prime labeling if its vertices are labeled with distinct integers 1,2,3,…,V(G) such that for each edge xy the labels assigned to x and y are relatively prime. A graph admits a prime labeling is called a prime graph. In this
paper, we prove that (PnS2)k, (PnS3)k and Cn Sm are prime graphs.
Copy the following to cite this article:
L. MEENAKSHI SUNDARAM*, A. NAGARAJAN, S. NAVANEETHAKRISHNAN and A. NELLAI MURUGAN, "Prime Labeling of Some Product Graphs", Journal of Ultra Scientist of Physical Sciences, Volume 25, Issue 2, Page Number , 2016Copy the following to cite this URL:
L. MEENAKSHI SUNDARAM*, A. NAGARAJAN, S. NAVANEETHAKRISHNAN and A. NELLAI MURUGAN, "Prime Labeling of Some Product Graphs", Journal of Ultra Scientist of Physical Sciences, Volume 25, Issue 2, Page Number , 2016Available from: https://www.ultrascientist.org/paper/256/