E-Cordial Labeling for Cartesian Product of Some Graphs

Abstract

We investigate E-cordial labeling for some cartesian product of graphs. We prove that the graphs Kn × P2 and Pn × P2 are E-cordial for n even while Wn × P2 and K1,n × P2 are E-cordial for n odd.