E-Cordiality of Tail C3Related One Point Union
Graphs

Mukund Bapat

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

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 56 | Number 6 | Year 2018 | Article Id. IJMTT-V56P553 | DOI : https://doi.org/10.14445/22315373/IJMTT-V56P553

E-Cordiality of Tail C3Related One Point Union Graphs

Mukund Bapat

Abstract

In this paper we obtain e-cordial labeling of one point union of k copies of tail graph namely G(k) where G = tail C3(Pt). We have taken different values of t as 2,3,4. If we change point of union on G then different structures of G(k) are obtained. Of these we have taken pairwise non isomorphic structures of G(k) and have proved that they all are e-cordial under certain conditions. We have also considered the case that more than one tails are attached to G such that sum of edges is t-1 for given t and the family is e-cordial.

Keywords

graph, E-cordial, tail graph, C3, labeling.

References

[1] Bapat M.V. Ph.D. thesis,University Of Mumbai, 2004
[2] Joe Gallian Dynamic survey of graph labeling 2016
[3] Harary,GraphTheory,Narosa publishing ,New Delhi
[4] Yilmaz,Cahit ,E-cordial graphs,Ars combina,46,251-256.
[5] A First look at Graph Theory. A book byJohn clark, D.Holton, world scientific.1 Mukund V. Bapat, Hindale, Devgad, Sindhudurg, Maharashtra, India

Citation :

Mukund Bapat, "E-Cordiality of Tail C3Related One Point Union Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 56, no. 6, pp. 402-407, 2018. Crossref, https://doi.org/10.14445/22315373/IJMTT-V56P553