TY - JOUR AU - Jeyanthi, P. AU - Selvi, M. AU - Ramya, D. PY - 2020/04/23 Y2 - 2024/03/29 TI - Restricted triangular difference mean graphs JF - Proyecciones (Antofagasta, On line) JA - Proyecciones (Antofagasta, On line) VL - 39 IS - 2 SE - DO - 10.22199/issn.0717-6279-2020-02-0017 UR - https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/4118 SP - 275-286 AB - <p><em>Let G = (V,E) be a graph with p vertices and q edges. Consider an injection f : V (G) → {1, 2, 3, ..., pq}. Define f∗ : E(G) → {T<sub>1</sub>, T<sub>2</sub>, T<sub>3</sub>, ..., T<sub>q</sub>}, where T<sub>q</sub> is the q<sup>th</sup> triangular number such that f∗(e) = &nbsp;&nbsp;for all edges e = uv. If f∗(E(G)) is a sequence of consecutive triangular numbers T<sub>1</sub>, T<sub>2</sub>, T<sub>3</sub>, ..., T<sub>q</sub>, then the function f is said to be restricted triangular difference mean. A graph that admits restricted triangular difference mean labeling is called restricted triangular difference mean graph. In this paper, we investigate restricted triangular difference mean behaviour of some standard graph.</em></p> ER -