3-product cordial labeling of some snake graphs
Pon Jeyanthi, A. Maheswari, M. Vijayalakshmi · Proyecciones (Antofagasta) · 2019
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.