Odd Prime labeling of Franklin graph

Abstract

A graph G = (V, E) with n vertices is said to admit prime labeling if its vertices can be labeled with distinct positive integers not exceed n such that the label of each pair of adjacent vertices are relatively prime. A Graph G which admits prime labeling is called prime graph. In this paper we investigate prime labeling for some classes of graph. In particular we discussed on prime labeling of Franklin graph.