Prime Cordial Labeling for Theta Graph
Arunachalam Sugumaran, P. Vishnu Prakash · Annals of Pure and Applied Mathematics · 2017
A prime cordial labeling of a graph; then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1.A graph which admits a prime cordial labeling is called a prime cordial graph.In this paper, we investigate the prime cordial labeling of Theta graph.We also discuss prime cordial labeling in the context of some graph operations namely duplication, switching, fusion, path union and the graph obtained by joining two copies of Theta graph by a path of arbitrary length .