Power Mean Graphs

S. Somasundaram; P. Mercy.

doi:https://doi.org/10.14445/22315373/IJMTT-V52P530

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 52 | Number 3 | Year 2017 | Article Id. IJMTT-V52P530 | DOI : https://doi.org/10.14445/22315373/IJMTT-V52P530

Power Mean Graphs

S. Somasundaram, P. Mercy.

Abstract

A graph G = (V, E) is called a Power mean graph with p vertices and q edges, if it is possible to label the vertices x 2 V with distinct elements f (x) from 1, 2, 3, · · · , q + 1 in such way that when each edge e = uv is labeled .

Keywords

Graphs, Power mean labeling, Power Mean graph, Path, Cycle, Comb, Ladder, Kn, K1,n .

References

[1] B.D. Acharya, S. Arumugam and A. Rosa. (2008). Labeling of Discrete Structures and Applications. Narosa Publishing House, New Delhi. 1–14.
[2] J.A. Gallian. (2012). A dynamic Survey of graph labeling. The electronic Journal of Combinatories. 17 DS6.
[3] F. Harary. (1988). Graph Theory. Narosa Publishing House, New Delhi.
[4] S. Somasundaram and R. Ponraj. (2003). Mean Labelings of Graphs. National Academy Science Letters. 26, 210-213.
[5] S. Somasundaram, R. Ponraj and S.S. Sandhiya. Harmonic mean labeling of graphs. Communicated to Journal of Combinatorial Mathematics and Combinatorial Computing.
[6] S. Somasundaram, P. Vidhyarani and R. Ponraj. (2011). Geometric Mean Labeling of Graphs. Bullettin of Pure and Applied Sciences. 30E(2), 153-160.
[7] S. S. Sandhya and S. Somasundaram. (2013). Harmonic Mean Labeling for Some Special Graphs. International Journal of Mathematics Research. 5(1), 55-64

Citation :

S. Somasundaram, P. Mercy., "Power Mean Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 52, no. 3, pp. 209-215, 2017. Crossref, https://doi.org/10.14445/22315373/IJMTT-V52P530