TY - JOUR
ID - 68965
TI - Vertex Switching in 3-Product Cordial Graphs
JO - Journal of Algorithms and Computation
JA - JAC
LA - en
SN - 2476-2776
AU - Jeyanthi, P.
AU - Maheswari, A.
AU - VijayaLakshmi, M.
AD - Principal and Head of the Research Centre,Department of Mathematics,Govindammal Aditanar College for Women,Tiruchendur,Tamilnadu,INDIA
AD - Department of Mathematics,
Kamaraj College of Engineering and Technology,
Virudhunagar, India.
AD - Department of Mathematics, Dr.G.U. Pope College of Engineering, Sawyerpuram,Thoothukudi District, Tamil Nadu, India
Y1 - 2018
PY - 2018
VL - 50
IS - 1
SP - 185
EP - 188
DO - 10.22059/jac.2018.68965
N2 - A mapping $f: V(G)\rightarrow\left\{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, j\in \{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.
UR - https://jac.ut.ac.ir/article_68965.html
L1 - https://jac.ut.ac.ir/article_68965_8b071b3e1293e051be82e794596f567c.pdf
ER -