One modulo three mean labeling of transformed trees

• Jeyanthi, P. ^[1] ; Maheswari, A. ^[2] ; Pandiaraj, P. ^[2]
  1. [1] Govindammal Aditanar College for Women.
  2. [2] Kamaraj College of Engineering and Technology.
• Localización: Proyecciones: Journal of Mathematics, ISSN 0716-0917, ISSN-e 0717-6279, Vol. 35, Nº. 3, 2016, págs. 277-289
• Idioma: inglés
• DOI: 10.4067/S0716-09172016000300005
• Enlaces
  • Texto completo
• Resumen

  • 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 byand the function φ is called one modulo three mean labeling of G. In this paper, we prove that the graphs T ° Kn, T ô K1,n, T ô Pn and T ô 2Pn are one modulo three mean graphs.

• Referencias bibliográficas
  • Citas [1] J. A. Gallian, A dynamic survey of graph labeling, The Electronic Journal of Combinatorics, 17, #DS6, (2015).
  • [2] F. Harary, Graph Theory, Addison Wesley, Massachusetts, 1972.
  • [3] S. M. Hegde, and Sudhakar Shetty,On Graceful Trees, Applied Mathematics E- Notes, 2, pp. 192-197, (2002).
  • [4] P. Jeyanthi and A. Maheswari, One modulo three mean labeling of graphs, American Journal of Applied Mathematics and Statistics, 2(5),...
  • [5] P. Jeyanthi, A. Maheswari and P. Pandiaraj, One Modulo Three Mean Labeling of Cycle Related Graphs, International Journal of Pure and...
  • [6] P. Jeyanthi, A. Maheswari and P. Pandiaraj, On one modulo three mean labeling of graphs, Journal of Discrete Mathematical Science &...
  • [7] S. Somasundaram, and R.Ponraj, Mean labeling of graphs, National Academy Science Letters, 26, pp. 210—213, (2003).
  • [8] V. Swaminathan and C. Sekar, Modulo three graceful graphs, Proceed. National Conference on Mathematical and Computational Models, PSG...