Effective Conversion of Non-Prime Graphs to Prime Graphs

A graph G is considered to have a prime labeling when each of its n vertices is assigned a unique label from the set {1, 2, 3, 4, ..., n}, ensuring that the labels of any two connected vertices are coprime. In the literature, many graph classes identified as prime graphs and non-prime graphs. In this paper, we focus on converting non-prime graph classes to a prime graph classes by applying corona product with complete graph on one vertex.