Some new classes of vertex-mean graphs.
DOI:
https://doi.org/10.4067/S0716-09172017000200283Keywords:
Mean labeling, Edge labeling, vertex-mean labeling, vertexmean graphsAbstract
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
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.
[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
-
Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.