Prime Labeling in Context of Ring Sum of Graphs

A. H. Rokad, G. V. Ghodasara

Abstract: A graph with vertex set V is said to have a prime labeling if its vertices are labeled with distinct integers 1, 2,. . . , |V | such that for each edge xy the labels assigned to x and y are relatively prime. In this paper we have derived prime labeling of ringsum of different graphs.

Keywords: labeling, ring Sum, cycle with one chord, cycle with twin chord, cycle with triangle, shell