Skolem difference mean labeling of disconnected graphs

• Jeyanthi, P. ^[1] ; Selvi, M. ^[2] ; Ramya, D. ^[3]
  1. [1] Govindammal Aditanar College for Women.
  2. [2] Dr. Sivanthi Aditanar College of Engineering.
  3. [3] Government Arts College for Women.

  Mostrar afiliaciones +
• Localización: Proyecciones: Journal of Mathematics, ISSN 0716-0917, ISSN-e 0717-6279, Vol. 36, Nº. 2, 2017, págs. 347-361
• Idioma: inglés
• DOI: 10.4067/S0716-09172017000200347
• Enlaces
  • Texto completo
• Referencias bibliográficas
  • Citas [1] HARARY, F. (1972) Graph theory. Massachusetts: Addison Wesley.
  • [2] GALLIAN, JOSEPH A. (2015) A Dynamic Survey of Graph Labeling. EN: The Electronic Journal of Combinatorics. [s.l.: s.n.].
  • [3] MURUGAN, K. (2012) Subramanaian, Labeling of finite union of paths. EN: International Journal of Mathematics and Soft Computing, 2, (1)....
  • [4] MURUGAN, K. (2011) Subramanaian, Skolem difference mean labeling of Hgraphs, International Journal of Mathematics and Soft Computing,...
  • [5] MURUGAN, K. (2015) Some Results on Skolem Difference Mean Graphs, International Journal of Mathematics and its Applications, 3, (3-D)....
  • [6] RAMYA, D. (2013) On skolem difference mean labeling of graphs. EN: International Journal of Mathematical Archive, 4, (12). [s.l.: s.n.],...
  • [7] SELVI, M. (2015) Skolem difference mean Graphs. EN: Proyecciones Journal of Mathematics, 34 (3). [s.l.: s.n.], 243-254.
  • [8] SOMASUNDARAM, S. (2003) Mean labelings of graphs. EN: National Academy Science Letter, (26). [s.l.: s.n.], 210-213.