eng Ansari Education and Research Society Journal of Ultra Scientist of Physical Sciences December 2008 20 3 613 618 jusps-B 1385 article Selvam Avadayappan (selvam_avadayappan@yahoo.co.in) 1 R. Sinthu (sinthu_maths@yahoo.co.in) 1 Department of Mathematics, V.H.N.S.N., College, Virudhunagar - 626 001 (INDIA) <p style="text-align: justify;">A graph G(V, E) is said to have a vertex prime labeling if its edges can be labeled with distinct integers from {1,2,3,..., |E|} such that for each vertex of degree at least 2, the greatest common divisor of the labels on its incident edges is 1. A graph that admits a vertex prime labeling is called a vertex prime graph. In this paper, we prove that mK_2,3 is a vertex prime graph, where m is any positive integer.<br /> <br /> &nbsp;</p> https://ultraphysicalsciences.org/paper/1385/ labeling of graphs vertex prime labeling of graphs