• S. Meena
• A. Ezhil

Let G = (V, E) be a graph with ‘p’ vertices and ‘q’ edges. A bijection f : V (G) → { 1,2,3,………….,p } is said to be prime labeling if for each edge e = uv , the labels assigned to u and v are relatively prime. A bijection f : V (G) U E (G) → {1,2,3……..(p+q)} is said to be a total prime labeling if, (i) For each edge e = uv, the labels assigned to u and v are relatively prime. (ii) For each vertex of degree at least two, the greatest common divisor of the labels of the incident edges is one. In this paper we investigated the total prime labeling of the one side triangular graph (t n), graph (C n . P m), graph (C n (m) ), graph m copies of C n and comb related graphs.

Labeling , prime labeling, total prime labeling

"Total Prime Labeling of Some Cycle and Path Related Graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 4, page no.685-693, April-2019, Available :http://www.jetir.org/papers/JETIR1904K98.pdf

"Total Prime Labeling of Some Cycle and Path Related Graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 4, page no. pp685-693, April-2019, Available at : http://www.jetir.org/papers/JETIR1904K98.pdf