Prime Labelings of Some Wheel And Crown Related Graphs

Abstract

A Graph G with n vertices is said to admit prime labeling if its vertices can be labeled with distinct positive integers not exceeding n such that the labels of 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 the existence of prime labeling of some graphs related to wheel $W_n$ and crown $C^*_n$. We discuss prime labeling in the context of the graph operation namely corona product.