• P. VISHNU PRAKASH
• A. SUGUMARAN

Let be a simple graph with p vertices and q edges. A 3-equitable prime cordial labeling of a graph is a bijection f from to such that if an edge uv is assigned the label if and the lable 2 if and and the label otherwise, then the number of edges labeled with i and the number of edges labeled with j differ by at most for If a graph has a 3-equitable prime cordial labeling, then it is called a 3-equitable prime cordial graph. In this paper, we discuss 3-equitable prime cordial labeling in the context of some graph operations namely duplication, switching, fusion, path union of two copies and the open star graph of Theta graph .

3-equitable prime cordial labeling, duplication, fusion, switching, path union and open star of graphs

"3-equitable Prime Cordial Labeling in Theta Graph", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.5, Issue 7, page no.332-338, July-2018, Available :http://www.jetir.org/papers/JETIR1807205.pdf

"3-equitable Prime Cordial Labeling in Theta Graph", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.5, Issue 7, page no. pp332-338, July-2018, Available at : http://www.jetir.org/papers/JETIR1807205.pdf