On Legendre Cordial Labeling of Complete Graphs

Abstract: Let $p$ be an odd prime. For a simple connected graph $G$ of order $n$, a bijective function $f:V(G)\to{1,2,\ldots,n}$ is said to be a Legendre cordial labeling modulo $p$ if the induced function $f_p^*:E(G)\to {0,1}$, defined by $f_p^* (uv)=0$ whenever $([f(u)+f(v)]/p)=-1$ or $f(u)+f(v)\equiv 0(\text{mod } p)$ and $f_p^* (uv)=1$ whenever $([f(u)+f(v)]/p)=1$, satisfies the condition $|e_{f_p^{<em>}(0)-e_{f_p^</em>}(1)|\leq} 1$ where $e_{f_p<sup>*}(i)$ is the number of edges with label $i$ ($i=0,1$). This paper explores the characterization of the Legendre cordial labeling modulo $p$ of the complete graph $K_n$ using the concept of Legendre graph.