Prime labeling in the context of web graphs without center

Abstract

A prime labeling on a graph G of order n is a bijection from the set of vertices of G into the set of first n positive integers such that any two adjacent vertices in G have relatively prime labels. In this paper we investigate prime labeling for web graphs without center and graphs resulting from the subdivision of some specific edges in it. We also derive some interesting results on prime labeling of union of web graph without center with wheel graph, generalized Jahangir graph and drum graph.