Prime Labeling on Few Trees of Diameter Less Than 6

Abstract

A graph which is simple, non-trivial, undirected and finite of size  and order  with the  and  as its vertex and the edge set respectively is said to admit prime labeling if an injective function  maps the every vertices is such that the gcd ( ) = 1. Then  is a Prime graph. Few Trees of diameter 2,3,4 and 5 graphs are established  to be prime graphs in  this paper,