Reference:

Books:
1. J.A. Bondy and U.S.R. Murty, Graph Theory and Applications, New York: Ma
cmillan Ltd. Press, (1976)
2. Gary Chartrand and Ping Zhang, Introduction to graph theory, Tata
McGraw-Hill boston(2005).
3. J.A.Gallian, A dynamic survey of graph labeling The electronic journal of com
binatorics 16 (2009), #DS6, 1-219.

Research Papers:
1. I.Cahit, Cordial graphs: a weaker version of graceful and harmonious gra
phs, Ars Combin. 23(1987), 201-207.
2. Recent results and open problems on cordial graphs, Contemporary Methods
in Graph Theory,209-230, Bibliographisches Inst., Mannheim, 1990. MR 92h:05118,
Zbl.Math.721.05052
3. H. K. Ng andd S.M. Lee, A Conjecture on Edge-Cordial Trees, Abstracts, A
mer. Math. Soc., 9, 286-287, 1988.
4. M. Benson and S-M. Lee, On cordialness of regular windmill graphs, Co
ngressus Numerantium 68 (1989), 49-58
5. Y. S. Ho, S.M. Lee, S.C. Shee, "Cordial labellings of unicyclic graphs a
nd generalized Petersen graphs", Congr. Numer.,68,1989, 109-122. MR 90f:05126, Z
bl.Math.672.05078
6. W. W. Kirchherr, "Algebraic approaches to cordial labeling",Graph theory
, combinatorics, algorithms and applications, (San Francisco, CA, 1989), 294-299
, SIAM Philadelphia, PA,1991. MR 93f:05082, Zbl.Math.751.05076.
7. I. Cahit, On cordial and 3-equitable graphs, Utilitas Mathematica 3
7 (1990), 189-198.
8. I. Cahit, Recent results and open problems on cordial graphs, Contem-
porary Methods in Graph Theory, Bibligraphisches Inst. Mannhiem (1990), 2
09-230.
9. Y.S. Ho, S-M. Lee, and S.C. Shee, Cordial labelings of the cartesian p
roduct and composition of graphs, Ars Combinatoria 29 (1990), 169-180.
10. K. Collins, "Most graphs are edge-cordial", Ars Combin., 30, 1990, 289-2
95. MR 91j:05091, Zbl.Math.734.05072.
11. M.Hovey, A-cordial graphs, Discrete Math. 93 (1991), 183-194.
12. W.W. Kirchherr, On the cordiality of certain specific graphs, Ars Com-
binatoria 31 (1991), 127-138.
13. S.M. Lee and A. Liu, A construction of cordial graphs from smaller
cordial graphs, Ars Combinatoria 32 (1991), 209-214.
14. E.Seah, on the construction of cordial graphs, Ars Combinitoria 31(1991)
, 249-254.
15. Y.H.Lee, H.M. Lee and G.J. Chang, Cordial labelings of graphs, Chinese
J. Math. 20(1992),263-273
16. W.W. Kirchherr, NEPS operations on cordial graphs, Discrete Mathematics
115 (1993), 201-209.
17. S.C.Shee and Y.S.Ho, The cordiality of one point union of n copies of a
graph, Discrete mathematics 117(1993),225-243.
18. E. Seah, "Further results on the neutrality of graphs", Ars Combin., 35,
1993, A, 209-216. MR 94m:05163.
19. S.C.Shee and Y.S.Ho, The cordiality of path-union of n copies of a graph
, Discrete mathematics 151(1996),221-229.
20. H-Cordial Graphs, Bull. Inst. Combin. Appl., 18, 1996, 87-101. MR 97g:05
144.

21. . S. Kuo, G.J. Chang, and Y.H.H. Kwong, Cordial labeling of mKn ,
Discrete Mathematics 169 (1997), 121-131.
22. E-Cordial Graphs, (with R. Yilmaz), Ars Combinatoria. , August 1997.
23. M.A. Seoud and A.E.I. Abdel Maqsoud, On cordial and balanced label- ings
of graphs, J. Egyptian Math. Soc. 7 (1999), 127-135.
24. N. Cairnie and K. Edwards, The computational complexity of cordial and e
quitable labeling, Discrete Maths., 216(2000), 29-34.
25. N.B. Limaye (with Mahesh Andar and Somina Boxwala) A Note on Cordial Lab
eling of Multiple Shells, Conference proceedings of International Conference on
Number Theory and Combinatorics, October 2000.