Abstract

In this paper some new families E-cordial graphs are investigated. We prove that the graphs obtained by duplication of an arbitrary vertex as well as an arbitrary edge in cycle $C_{n}$ admit E-cordial labeling. In addition to this we derive that the joint sum of two copies of cycle $C_{n}$, the split graph of cycle $C_{n}$ of even order and the shadow graph of path $P_{n}$ for even $n$ are E-cordial graphs.

This work is licensed under a Creative Commons Attribution 4.0 License.