Edge Natural Product Cordial ( enpc) Labeling: A new Graph Labeling Method

Mukund V. Bapat

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

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

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

Edge Natural Product Cordial ( enpc) Labeling: A new Graph Labeling Method

Mukund V. Bapat

Abstract

We obtain a new type of graph labeling called as Edge Natural product cordial labeling.For a graph G= (p, q) the edges takes value from Nq and the vertices labels are derived by taking product of incident edge labels over (modulo 2).We show that Cn is enpc iff n is odd number,path Pm, Snake S(C3,m), S(C4,m) ,Pm(C4) under respective conditions are families of enpc graphs.

Keywords

Edge Natural Product Cordial ( enpc), Fusion of vertex, incident edge labels

References

[1] Bapat Mukund ,Ph.D. thesis submitted to university of Mumbai.India 2004.
[2] Bapat Mukund V. Some Path Unions Invariance Under Cordial labeling,IJSAM feb.2018 issue.
[3] I.Cahit, Cordial graphs: a weaker version of graceful and harmonious graphs, Ars Combin., 23 (1987) 201-207.
[4] J. Clark and D. A. Holton, A first look at graph theory; world scientific
[5] Harary,Graph Theory,Narosa publishing ,New Delhi
[6] Yilmaz,Cahit ,E-cordial graphs,Ars combina,46,251-256.
[7] J.Gallian, Dynamic survey of graph labeling, E.J.C 2017
[8] D. WEST,Introduction to Graph Theory ,Pearson Education Asia.

Citation :

Mukund V. Bapat, "Edge Natural Product Cordial ( enpc) Labeling: A new Graph Labeling Method," International Journal of Mathematics Trends and Technology (IJMTT), vol. 57, no. 6, pp. 389-393, 2018. Crossref, https://doi.org/10.14445/22315373/IJMTT-V57P553