Prime labeling of graphs constructed from wheel graph

Abstract

A prime labeling of a simple undirected graph G is to assign unique integer labels from the set {1,2,...,|V(G)|} to each vertex such that any two adjacent vertices in the graph have labels that are relatively prime. Studying prime labeling in graphs can help us understand the structure and properties of graphs and prime labeling has potential applications in cryptography and network security. In this paper we investigate when some graphs that are constructed from wheels are prime graphs.