• PRIME LABELING FOR SOME BUTTERFLY RELATED GRAPHS

Abstract

A graph with vertices is said to admit prime labeling if its vertices can be labeled with distinct positive integers not exceeding such that the label 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 prime labeling for some graphs related to butterfly graph. We discuss prime labeling in the context of some graph operations namely fusion, duplication in butterfly graph