3-Modulo Difference Mean Cordial Labeling of Some Graphs

S.S.Sabarina Subi; Dr.S.Pasunkilipandian

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

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 65 | Issue 4 | Year 2019 | Article Id. IJMTT-V65I4P502 | DOI : https://doi.org/10.14445/22315373/IJMTT-V65I4P502

3-Modulo Difference Mean Cordial Labeling of Some Graphs

S.S.Sabarina Subi, Dr.S.Pasunkilipandian

Abstract

Let G = (V,E) be a simple graph with p vertices and q edges.

Keywords

3-modulo difference mean cordial labeling, 3-modulo difference mean cordial graphs.

References

[1] Gallian J.A,A Dynamic Survey of Graph Labeling,The Electronic Journal of Combinatorics,6(2001)#DS6.
[2] Harray.F Graph Theory,Adadison-Wesley Publishing Company inc,USA,1969.
[3] NellaiMurugan .A and Esther.G,Some Results on Mean Cordial Graphs,International Journal of Mathematics Trends and Technology,ISSN:2231-5373,Volume 11 Number 2-Jul 2014,page 97-101.
[4] SabarinaSubi.S.S and Nagarajan.A,3-Modulo Cordial Graphs on Cycle Related Graphs,International Journal for Science and Advance research in technology,ISSN[ONLINE]:2395-1052,Volume 4,Issue 2,February 2018,Pp.889-894.

Citation :

S.S.Sabarina Subi, Dr.S.Pasunkilipandian, "3-Modulo Difference Mean Cordial Labeling of Some Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 65, no. 4, pp. 4-13, 2019. Crossref, https://doi.org/10.14445/22315373/IJMTT-V65I4P502