## Tbilisi Mathematical Journal

### Difference cordiality of product related graphs

#### Abstract

Let $G$ be a $\left(p,q\right)$ graph. Let $f:V\left(G\right)\to \left\{1,2,\dots ,p\right\}$ be a function. For each edge $uv$, assign the label $\left|f(u)-f(v)\right|$. $f$ is called a difference cordial labeling if $f$ is an injective map and $\left|e_{f} \left(0\right)-e_{f} \left(1\right)\right|\leq 1$ where $e_{f} \left(1\right)$ and $e_{f} \left(0\right)$ 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 $C_{m}\times C_{n}$, $K_{m}\times P_{2}$, prism, book, mobius ladder, Mongolian tent and $n$-cube.

#### Article information

Source
Tbilisi Math. J., Volume 8, Issue 2 (2015), 41-47.

Dates
Accepted: 6 April 2015
First available in Project Euclid: 12 June 2018

https://projecteuclid.org/euclid.tbilisi/1528769005

Digital Object Identifier
doi:10.1515/tmj-2015-0009

Mathematical Reviews number (MathSciNet)
MR3343673

Zentralblatt MATH identifier
1311.05171

Subjects
Primary: 05C78: Graph labelling (graceful graphs, bandwidth, etc.)

#### Citation

Ponraj, R.; Narayanan, S. Sathish; Kala, R. Difference cordiality of product related graphs. Tbilisi Math. J. 8 (2015), no. 2, 41--47. doi:10.1515/tmj-2015-0009. https://projecteuclid.org/euclid.tbilisi/1528769005

#### References

• I. Cahit, Cordial graphs: a weeker version of graceful and harmonious graphs, Ars Combin., 23 (1987), 201–207.
• E. Salehi, PC-labelings of a graphs and its PC-sets, Bull. Inst. Combin. Appl., 58 (2010), 112–121.
• J. A. Gallian, A Dynamic survey of graph labeling, The Electronic Journal of Combinatorics, 18 (2012), #Ds6.
• F. Harary, Graph theory, Addision wesley, New Delhi (1969).
• 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.
• R. Ponraj, S. Sathish Narayanan and R.Kala, Difference cordial labeling of corona graphs, J. Math. Comput. Sci., 3(2013), 1237–1251.
• R. Ponraj and S. Sathish Narayanan, Difference cordial labeling of some derived graphs, International journal of Mathematical combinatorics, 4 (2014), 37–48.
• 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.
• R. Ponraj, S. Sathish Narayanan and R. Kala, A note on difference cordial graphs, Palestein Journal of Mathematics, 4(1) (2015), 189–197.
• R. Ponraj and S. Sathish Narayanan, Difference cordial labeling of graphs obtained from triangular snakes, Application and Applied Mathematics, 9(2) (2014), 811–825.
• 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.
• M. Z. Youssef, On Skolem-graceful and cordial graphs, Ars Combin., 78 (2006), 167–177.
• M. Z. Youssef, On k-cordial labelling, Australas. J. Combin., 43 (2009), 31–37.
• M. Z. Youssef, Graph operations and cordiality, Ars Combin., 97 (2010), 161–174.