@article {
author = {Jeyanthi, P. and Maheswari, A. and VijayaLakshmi, M.},
title = {Vertex Switching in 3-Product Cordial Graphs},
journal = {Journal of Algorithms and Computation},
volume = {50},
number = {1},
pages = {185-188},
year = {2018},
publisher = {University of Tehran},
issn = {2476-2776},
eissn = {2476-2784},
doi = {10.22059/jac.2018.68965},
abstract = {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.},
keywords = {},
url = {https://jac.ut.ac.ir/article_68965.html},
eprint = {https://jac.ut.ac.ir/article_68965_8b071b3e1293e051be82e794596f567c.pdf}
}