Research ArticleOpen AccessGoogle Scholar indexed
New Results on One Modulo N-Difference Mean Graphs
Research Centre, Department of Mathematics, Govindammal Aditanar College for Women, Tiruchendur, Tamilnadu, India
Department of Mathematics, Dr. Sivanthi Aditanar College of Engineering, Tiruchendur, Tamilnadu, India
Department of Mathematics, Government Arts College (Autonomous), Salem-7, Tamilnadu, India
- 1 Research Centre, Department of Mathematics, Govindammal Aditanar College for Women, Tiruchendur, Tamilnadu, India
- 2 Department of Mathematics, Dr. Sivanthi Aditanar College of Engineering, Tiruchendur, Tamilnadu, India
- 3 Department of Mathematics, Government Arts College (Autonomous), Salem-7, Tamilnadu, India
Open Journal of Discrete Mathematics·Volume 13 (2023)·Pages 100–112·Published 27 September 2023·DOI10.4236/ojdm.2023.134010
Copy link · social · email
Abstract
A graph G is said to be one modulo N-difference mean graph if there is an injective function f from the vertex set of G to the set , where N is the natural number and q is the number of edges of G and f induces a bijection from the edge set of G to given by and the function f is called a one modulo N-difference mean labeling of G . In this paper, we show that the graphs such as arbitrary union of paths, , ladder, slanting ladder, diamond snake, quadrilateral snake, alternately quadrilateral snake, , , , , friendship graph and admit one modulo N-difference mean labeling.
KeywordsSkolem Difference Mean LabelingOne Modulo N-Graceful LabelingOne Modulo N-Difference Mean Labeling and One Modulo N-Difference Mean Graph
- Harary, F. (1972) Graph Theory. Addison Wesley, Massachusetts.
- Somasundram, S. and Ponraj, R. (2003) Mean Labeling of Graphs. National Academy Science Letter, 26, 210-213.
- Gallian, J.A. (2022) A Dynamic Survey of Graph Labeling. The Electronic Journal of Combinatorics, 25, 1-623. https://doi.org/10.37236/11668
- Murugan, K. and Subramanian, A. (2011) Skolem Difference Mean Labeling of H-Graphs. International Journal of Mathematics and Soft Computing, 1, 115-129.
- Ramachandran, V. and Sekar, C. (2014) One Modulo N-Gracefulness of Arbitrary Super Subdivisions of Graphs. International Journal of Mathematical Combinatorics, 2, 36-46.
- Jeyanthi, P., Selvi, M. and Ramya, D. (2023) One Modulo N-Difference Mean Graphs. Palestine Journal of Mathematics, 12, 161-168.