Restricted triangular difference mean graphs

• Jeyanthi, P. ^[2] ; Selvi, M. ^[1] ; Ramya, D. ^[3]
  1. [1] Manonmaniam Sundaranar University

     Manonmaniam Sundaranar University

     India

     
  2. [2] Govindammal Aditanar College for Women.
  3. [3] Government Arts College (Autonomous).

  Mostrar afiliaciones +
• Localización: Proyecciones: Journal of Mathematics, ISSN 0716-0917, ISSN-e 0717-6279, Vol. 39, Nº. 2, 2020, págs. 275-286
• Idioma: inglés
• DOI: 10.22199/issn.0717-6279-2020-02-0017
• Enlaces
  • Texto completo
• Resumen

  • 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.

• Referencias bibliográficas
  • 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.