DEGREE SPLITTING OF STOLARSKY-3 MEAN LABELING OF GRAPHS

International Conference on Algebra and Discrete Mathematics (ICADM-2020) on 24 to 26, June 2020, Department of Mathematics, DDE, Madurai Kamaraj University, Tamil Nadu, India. International Journal of Computer Science (IJCS) Published by SK Research Group of Companies (SKRGC)

Abstract

A graph ???? = (????, e) with p vertices and q edges is called a Stolarsky-3 mean graph if it is possible to label the vertices…… Download PDF.

References

[1] J.A.Gallian, A Dynamic Survey of Graph Labeling. The Electronic Journal of combinatories (2013).

[2] Harary.F (1988), Graph Theory, Narosa publishing House, New Delhi.

[3] S.Somasundaram and R.Ponraj, “Mean Labeling of graphs”, National Academy of Science Letters vol.26, p.210-213.

[4] S.Somasundaram, R.Ponraj and S.S.Sandhya, “Harmonic Mean Labeling of Graphs”,communicated to Journal of Combinatorial Mathematics and Combinatorial Computing.

[5] S.S.Sandhya,S.Somasundaram, S.Anusa, “Degree Splitting of Root square mean Mean Graphs”, International Mathematical Forum, 10, 25-34.

[6] S.S.Sandhya, E.Ebin Raja Merly and S.D.Deepa, “Degree Splitting of Heronian Mean Graphs”, Journal of Mathematics Research, Vol.8, No.5(2016), ISSN 1916-9795,

Keywords

Labeling, Stolarsky-3 Mean Labeling, Degree splitting graph.