PRIME LABELLING FOR SOME BIPARTIATE RELATED GRAPHS

A graph G = (V,E) with ‘n’ vertices is said to have a prime labeling if its vertices are labelled with distinct positive integers not exceeding n such that for each pair of adjacent vertices are relatively prime.  A graph G which admits prime labeling is called a prime graph.  In this paper, we investigate prime labeling for some bipartiate and cycle related graphs.  We also discuss the prime labeling of some graph operation namely joint sum and path joining of bipartiate and cycle graphs