Difference cordiality of product related graphs

Open access

Abstract

Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , p} be a function. For each edge uv, assign the label |f(u) − f(v)|. f is called a difference cordial labeling if f is an injective map and |ef (0) − ef (1)| ≤ 1 where ef (1) and ef (0) denote the number of edges labeled with 1 and not labeled with 1 respectively. A graph which admits a difference cordial labeling is called a difference cordial graph. In this paper, we investigate the difference cordiality of torus grids Cm × Cn, Km × P2, prism, book, mobius ladder, Mongolian tent and n-cube.

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

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

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

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

[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.

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

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

[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.

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

[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.

[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.

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

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

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