Here we investigate E-cordial labeling of some graphs. We prove that the Möbius ladder middle graph of and crown admit E-cordial labeling for even n while bistar and its square graph admit E-cordial labeling for odd n.
