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 edge the labels assigned to x and y are relatively prime . A graph which admits prime labeling is called a prime graph. In this paper, we investigated prime labeling for Chavatal related graphs.
Keywords: Prime labeling, prime graph, Chavatal graph, corona, Duplication.