Some New Families of E-Cordial Graphs

S K Vaidya, Lekha Bijukumar


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.

Full Text:



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

Journal of Mathematics Research   ISSN 1916-9795 (Print)   ISSN 1916-9809 (Online)

Copyright © Canadian Center of Science and Education

To make sure that you can receive messages from us, please add the '' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.