Some Recent Advances in Prime Cordial Labeling of Graphs

Abstract

This paper deals with the prime cordial labeling of graphs obtained by performing graph operations namely, corona product and extension of vertex, on some well-known graphs. Further, certain interesting conjectures and open problems concerning prime cordial labeling are also formulated.