Some new classes of vertex-mean graphs.

• Autores: A. Lourdusamy, M. Seenivasan
• Localización: Proyecciones: Journal of Mathematics, ISSN 0716-0917, ISSN-e 0717-6279, Vol. 36, Nº. 2, 2017, págs. 283-298
• Idioma: inglés
• DOI: 10.4067/S0716-09172017000200283
• Enlaces
  • Texto completo
• Resumen

  • A vertex-mean labeling of  a (p, q) graph G = (V, E)  is defined as an injective function f : E ⟶ {0, 1, 2, ..., q*} , q* = max (p,q) such that the function fV : V ⟶ N  defined by the rule

• Referencias bibliográficas
  • Citas [1] Acharya, B. D. (2010) Vertex-graceful graphs. EN: Journal of Discrete Mathematical Science & Cryptography, 13(5). [s.l.: s.n.],...
  • [2] Gallian, J. A. (2011) A dynamic survey of graph labeling. EN: The electronic journal of combinatorics, 18. [s.l.: s.n.].
  • [3] Lourdusamy, A. (2011) Vertex-mean graphs. EN: International journal of Mathematical Combinatorics, 3. [s.l.: s.n.], 114-120.
  • [4] Somasundaram, S. (2003) Mean labelings of graphs. EN: Natl Acad, Sci. Let., 26. [s.l.: s.n.], 210-213.