Restricted triangular difference mean graphs




Restricted triangular difference mean labeling


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.

Author Biographies

P. Jeyanthi, Govindammal Aditanar College for Women.

Dept. of Mathematics, Research Centre.

M. Selvi, Manonmaniam Sundaranar University.

Research Scholar, Regn. No.12208

D. Ramya, Government Arts College (Autonomous).

Dept. of Mathematics.


F. Harary, Graph theory. Reading, MA: Addison-Wesley, 1972.

J. Gallian, “A dynamic survey of graph labeling”, 22th ed. The electronics journal of combinatorics, vol. # DS6, p. 535, 2019, doi: 10.37236/27.

P. Jeyanthi, M. Selvi, and D. Ramya, “Triangular difference mean graphs”, International journal of mathematical combinatorics, to appear.



How to Cite

P. Jeyanthi, M. Selvi, and D. Ramya, “Restricted triangular difference mean graphs”, Proyecciones (Antofagasta, On line), vol. 39, no. 2, pp. 275-286, Apr. 2020.