[1] I. Cahit, Cordial graphs: a weeker version of graceful and harmonious graphs, Ars Combin., 23
(1987), 201–207.
Google Scholar

[2] E. Salehi, PC-labelings of a graphs and its PC-sets, Bull. Inst. Combin. Appl., 58 (2010), 112–
121.
Google Scholar

[3] J. A. Gallian, A Dynamic survey of graph labeling, The Electronic Journal of Combinatorics,
18 (2012), #Ds6.
Google Scholar

[4] F. Harary, Graph theory, Addision wesley, New Delhi (1969).
Google Scholar

[5] R. Ponraj, S. Sathish Narayanan and R. Kala, Difference cordial labeling of graphs, Global
Journal of Mathematical Sciences: Theory and Practical, 5 (2013), 185–196.
Google Scholar

[6] R. Ponraj, S. Sathish Narayanan and R.Kala, Difference cordial labeling of corona graphs, J.
Math. Comput. Sci., 3(2013), 1237–1251.
Google Scholar

[7] R. Ponraj and S. Sathish Narayanan, Difference cordial labeling of some derived graphs, International
journal of Mathematical combinatorics, 4 (2014), 37–48.
Google Scholar

[8] R. Ponraj and S. Sathish Narayanan, Difference cordial labeling of some snake graphs, Journal
of Applied Mathematics and Informatics, 32(3-4) (2014), 377–387.
Google Scholar

[9] R. Ponraj, S. Sathish Narayanan and R. Kala, A note on difference cordial graphs, Palestein
Journal of Mathematics, 4(1) (2015), 189-197.
Google Scholar

[10] R. Ponraj and S. Sathish Narayanan, Difference cordial labeling of graphs obtained from trian-
gular snakes, Application and Applied Mathematics, 9(2) (2014), 811–825.
Google Scholar

[11] A. Rosa, On certain valuation of the vertices of a graph, Theory of Graphs (Internat. Symposium,
Rome, July 1966), Gordon and Breach, N. Y. and Dunod Paris (1967), 349–355.
Google Scholar

[12] M. Z. Youssef, On Skolem-graceful and cordial graphs, Ars Combin., 78 (2006), 167–177.
Google Scholar

[13] M. Z. Youssef, On k-cordial labelling, Australas. J. Combin., 43 (2009), 31–37.
Google Scholar

[14] M. Z. Youssef, Graph operations and cordiality, Ars Combin., 97 (2010), 161–174.
Google Scholar

## Comments (0)