Open Access
Translator Disclaimer
December 2015 Difference cordiality of product related graphs
R. Ponraj, S. Sathish Narayanan, R. Kala
Author Affiliations +
Tbilisi Math. J. 8(2): 41-47 (December 2015). DOI: 10.1515/tmj-2015-0009


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.


Download Citation

R. Ponraj. S. Sathish Narayanan. R. Kala. "Difference cordiality of product related graphs." Tbilisi Math. J. 8 (2) 41 - 47, December 2015.


Received: 7 May 2014; Accepted: 6 April 2015; Published: December 2015
First available in Project Euclid: 12 June 2018

zbMATH: 1311.05171
MathSciNet: MR3343673
Digital Object Identifier: 10.1515/tmj-2015-0009

Primary: 05C78

Rights: Copyright © 2015 Tbilisi Centre for Mathematical Sciences


Vol.8 • No. 2 • December 2015
Back to Top