Some new classes of vertex-mean graphs.

Authors

  • A. Lourdusamy St. Xavier’s College.
  • M. Seenivasan Sri Paramakalyani College.

DOI:

https://doi.org/10.4067/S0716-09172017000200283

Keywords:

Mean labeling, Edge labeling, vertex-mean labeling, vertexmean graphs

Abstract

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

Author Biographies

A. Lourdusamy, St. Xavier’s College.

Department of Mathematics.

M. Seenivasan, Sri Paramakalyani College.

Department of Mathematics.

 

References

[1] Acharya, B. D. (2010) Vertex-graceful graphs. EN: Journal of Discrete Mathematical Science & Cryptography, 13(5). [s.l.: s.n.], 453-463.

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

Published

2017-06-02

How to Cite

[1]
A. Lourdusamy and M. Seenivasan, “Some new classes of vertex-mean graphs.”, Proyecciones (Antofagasta, On line), vol. 36, no. 2, pp. 283-298, Jun. 2017.

Issue

Section

Artículos