Prime Graphs of Some Graphs

M. Simaringa and K. Santhoshkumar

A Graph G with vertex set V is said to be have a prime labeling if the vertices can be bijectively labeled with distinct positive integers 1, 2, 3, . . . , |V| such that labels of each adjacent vertices are relatively prime labels. A Graph G which admits a prime labeling is called a prime graph. In this paper, we shall prove that identification of graphs and one point union of graphs are prime graphs.

Volume 12 | Issue 8

Pages: 51-55

DOI: 10.5373/JARDCS/V12I8/20202445