TY - JOUR AU - Jeyanthi, P. AU - Maheswari, A. AU - Pandiaraj, P. PY - 2017/03/23 Y2 - 2024/03/29 TI - One modulo three mean labeling of transformed trees JF - Proyecciones (Antofagasta, On line) JA - Proyecciones (Antofagasta, On line) VL - 35 IS - 3 SE - DO - 10.4067/S0716-09172016000300005 UR - https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/1219 SP - 277-289 AB - <p style="font-size: 13.192px; font-family: verdana, arial;" align="justify"><span style="font-family: verdana; font-size: x-small;">A graph G is said to be one modulo three mean graph if there is an injective function φ from the vertex set of G to the set {a|0 ≤ a ≤ 3q— 2 and either a ≡ 0(mod 3) or a ≡ 1(mod 3)} where q is the number of edges G and φ induces a bijection φ* from the edge set of G to {a|1 ≤ a ≤ 3q — 2 and either a ≡ 1(mod 3)} given by</span></p><p style="font-size: 13.192px; font-family: verdana, arial;" align="justify"><img src="http://www.scielo.cl/fbpe/img/proy/v35n3/art5_fig1.jpg" alt="" width="242" height="77" /></p><p style="font-size: 13.192px; font-family: verdana, arial;" align="justify"><span style="font-family: verdana; font-size: x-small;">and the function φ is called one modulo three mean labeling of G. In this paper, we prove that the graphs T ° K<sub>n</sub>, T ô K<sub>1,n</sub>, T ô P<sub>n</sub> and T ô 2P<sub>n </sub>are one modulo three mean graphs.</span></p> ER -