Resumen de Restricted triangular difference mean graphs
P. Jeyanthi, M. Selvi, D. Ramya
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) → {T1, T2, T3, ..., Tq}, where Tq is the qth triangular number such that f∗(e) = for all edges e = uv. If f∗(E(G)) is a sequence of consecutive triangular numbers T1, T2, T3, ..., Tq, 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.
