University of Tehran
Journal of Algorithms and Computation
50
1
2018
06
01
Vertex Switching in 3-Product Cordial Graphs
185
188
68965
EN
P.
Jeyanthi
Principal and Head of the Research Centre,Department of Mathematics,Govindammal Aditanar College for Women,Tiruchendur,Tamilnadu,INDIA
A.
Maheswari
Department of Mathematics,
Kamaraj College of Engineering and Technology,
Virudhunagar, India.
M.
VijayaLakshmi
Department of Mathematics, Dr.G.U. Pope College of Engineering, Sawyerpuram,Thoothukudi District, Tamil Nadu, India
Journal Article
2018
01
23
A mapping $f: V(G)rightarrowleft{0, 1, 2 right}$ is called 3-product cordial labeling if $vert v_f(i)-v_f(j)vert leq 1$ and $vert e_f(i)-e_f(j)vert leq 1$ for any $ i, jin {0, 1, 2}$, where $v_f(i)$ denotes the number of vertices labeled with $i, e_f (i)$ denotes the number of edges $xy$ with $f(x)f(y)equiv i(mod 3)$. A graph with 3-product cordial labeling is called 3-product cordial graph. In this paper we establish that vertex switching of wheel,gear graph and degree splitting of bistar are 3-product cordial graphs.
https://jac.ut.ac.ir/article_68965_8b071b3e1293e051be82e794596f567c.pdf