Prime Labeling of Some Special Class of graphs

AUTHOR AND
AFFILIATION

L. MEENAKSHI SUNDARAM* and A. NAGARAJAN
Department of Mathematics, V.O.Chidambaram College, Thoothukudi-628 008, Tamil Nadu (India)
Email:*lmsundar79@gmail.com

KEYWORDS:

Prime Labeling, prime graphs

Issue Date:

September 2016

Pages:

ISSN:

2319-8044 (Online) – 2231-346X (Print)

Source:

Vol.28 – No.4

PDF

Click Here Download PDF

DOI:

Papers

" class="doi_url">

Papers

ABSTRACT:

Prime labeling originated with Entringer and was introduced by Tout, Dabboucy and Howalla5. 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 Kn c+K2, (Kn c+K2)  K1, , Fm @ 2Pn, Cm @ 2Pn and are prime graphs

Copy the following to cite this Article:

L. MEENAKSHI SUNDARAM* and A. NAGARAJAN, “Prime Labeling of Some Special Class of graphs”, Journal of Ultra Scientist of Physical Sciences, Volume 28, Issue 4, Page Number , 2016


Copy the following to cite this URL:

L. MEENAKSHI SUNDARAM* and A. NAGARAJAN, “Prime Labeling of Some Special Class of graphs”, Journal of Ultra Scientist of Physical Sciences, Volume 28, Issue 4, Page Number, 2016

Available from: http://www.ultrascientist.org/paper/578/