Keywords:-

Keywords: Relaxed skolem mean graphs, relaxed skolem mean labeling, 4-star graph

Article Content:-

Abstract

To prove that the 4 - star graph  where  is a relaxed skolem mean graph if  ꞵ - α1 – α2 – α3 = 6 is the core objective of this article.

References:-

References

M. Apostal, “Introduction to Analytic Number Theory”, Narosa Publishing House, Second edition, 1991.

J. A. Bondy and U. S. R. Murty, “Graph Theory with Applications”, Macmillan press, London, 1976.

J. C. Bermond,” Graceful Graphs, Radio Antennae and French Wind Mills”, Graph Theory and Combinatories, Pitman, London, 1979, 13 – 37.

V. Balaji, D. S. T. Ramesh and A. Subramanian, “Skolam Mean Labeling”, Bulletin of Pure and Applied Sciences, vol. 26E No. 2, 2007, 245 – 248.

V. Balaji, D. S. T. Ramesh and A. Subramanian, “Relaxed Skolam Mean Labeling”, Advances and Applications in Discrete Mathematics, vol. 5(1), January 2010, 11 – 22.

V. Balaji, D. S. T. Ramesh and A. Subramanian, “Some Results on Relaxed Skolam Mean Graphs”, Bulletin of Kerala Mathematics Association, vol. 5(2), December 2009, 33 – 44.

J. A. Gallian, “A Dynamic Survey of Graph Labeling”, The Electronic Journal of combinatorics 14(2007).

Downloads

Citation Tools

How to Cite
Jovanna, D. D. A. (2025). Relaxed Skolem Mean Labeling of 4 - Star Graph with Partition (3,1). International Journal Of Mathematics And Computer Research, 13(4), 5084-5086. https://doi.org/10.47191/ijmcr/v13i4.09