3-product cordial labeling of some snake graphs.
Keywords:
Cordial labeling, Product cordial labeling, 3-product cordial labeling, 3-product cordial graph, Alternate triangular snake, DoublƩ alternate triangular snake, Triangular snake graphAbstract
Let G be a (p,q) graph. A mapping š : V (G) ā {0, 1, 2} is called 3-product cordial labeling if |vš(i) ā vš (j)| ā¤ 1 and |eš (i) ā eš (j)| ā¤ 1 for any i, j ā {0, 1, 2},where vš (i) denotes the number of vertices labeled with i, eš (i) denotes the number of edges xy with š(x)š(y) ā” i(mod3). A graph with 3-product cordial labeling is called 3-product cordial graph. In this paper we investigate the 3-product cordial behavior of alternate triangular snake, double alternate triangular snake and triangular snake graphs.References
I. Cahit, Cordial Graphs :A weaker version of graceful and harmonious graphs, Ars Combinatoria, Vol. 23, pp. 201-207, (1987).
Joseph A. Gallian, A dynamic survey of graph labeling, The Electronic Journal of Combinatorics, (2017),# DS6.
F. Harary, Graph theory, Addison Wesley, Massachusetts, (1972).
P. Jeyanthi and A. Maheswari, 3-Product cordial labeling, SUT Journal of Mathematics, 48, pp. 231-140, (2012).
P. Jeyanthi and A. Maheswari, 3-Product cordial labeling of some graphs, International Journal on Mathematical Combinatorics, Vol. 1, pp. 96-105, (2012).
P. Jeyanthi and A. Maheswari, 3-Product cordial labeling of star graphs, Southeast Asian Bulletin of Mathematics, Vol. 39 (3), pp. 429-437, (2015).
P. Jeyanthi and A. Maheswari, Some results on 3-Product cordial labeling, Utilitas Math., Vol. 99, pp. 215-229, (2016).
R. Ponraj, M. Sivakumar and M. Sundaram, k-Product Cordial Labeling of Graphs, Int. J. Contemp. Math. Sciences, Vol. 7 (15), pp. 733-742, (2012).
M. Sundaram, R. Ponraj and S. Somasundaram, EP-cordial labelings of graphs, Varahmihir Journal of Mathematical Sciences,Vol. 7 (1), pp. 183-194, (2007).
_(1).png)
