Some Results on E - Cordial Graphs

S.Venkatesh; Jamal Salah; G.Sethuraman

doi:https://doi.org/10.14445/22315373/IJMTT-V7P516

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 7 | Number 2 | Year 2014 | Article Id. IJMTT-V7P516 | DOI : https://doi.org/10.14445/22315373/IJMTT-V7P516

Some Results on E - Cordial Graphs

S.Venkatesh , Jamal Salah , G.Sethuraman

Abstract

Let G(V,E) be a finite simple graph. Let φ be a function from the edge set E to {0,1}. For each vertex v∈V, define φ(v)=∑▒〖{φ(uv):uv ∈E}(mod 2).〗 The function φ is called an E-cordial labeling of G, if the number of edges labeled 0 and the number of edges labeled 1 differs by at most one and the number of vertices labeled 0 and the number of vertices labeled 1 differs by at most one. A graph that admits E-cordial labeling is said to E - Cordial. In this paper, we prove that Odd Snakes and C_m^((t)), that is one vertex union of t copies of C_m , for t –even and m – odd are E - Cordial.

Keywords

Snakes, One vertex union of cycles, E - Cordial labeling, E - Cordial graphs.

References

[1] D.B. West. Introduction to Graph Theory, Prentice Hall of India, 2001.
[2] J.A. Gallian, A dynamic survey of graph labeling, The Electronic Journal of Combinatorics,# DS6, 2013.
[3] I. Cahit, Cordial Graphs : A weaker version of graceful and harmonious graphs, Ars Combinatoria, 23, pp. 201–207, 1987.
[4] R. Yilmaz and I. Cahit E-Cordial graphs, Ars Combinatoria, 46, pp. 251 – 266, 1997.

Citation :

S.Venkatesh , Jamal Salah , G.Sethuraman, "Some Results on E - Cordial Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 7, no. 2, pp. 121-125, 2014. Crossref, https://doi.org/10.14445/22315373/IJMTT-V7P516