Edge Vertex Prime Labeling of Union of Graphs

Abstract

A graph  is said to be an edge vertex prime labeling if its vertices and edges are labeled with distinct positive numbers not exceeding  such that  for any edge  and   are pairwise relatively prime. A graph which admits an edge vertex prime labeling is called an edge vertex prime graph. We prove that some class of union of graphs such as  is even for  and  when  and one point union of wheel and cycle related graphs are edge vertex prime.