Prime Labeling For Some Crown Related Graphs

Abstract - A graph with vertex set V is said to have a prime labeling if its vertices are labeled with distinct integer 123-V such that for edge xy the labels assigned to x and y are relatively prime. A graph which admits prime labeling is called a prime graph. In this paper we investigate prime labeling for some Crown related graphs. We also discuss prime labeling in the context of some graph operations namely fusion and duplication switching path union in Crown graph2612310 C2612311n.