← Back to Volume 47, Issue 2 Contents
MODULO TWO SQUARE MEAN LABELING OF HURDLE GRAPHS, COMB GRAPHS AND $F(P_n)$ GRAPHS AND ITS ALGORITHMS
Christopher M.1, Ramachandran V.2
1 Research Scholar, PG and Research Department of Mathematics, Mannar Thirumalai Naicker College (Affiliated to Madurai Kamaraj University), Madurai, Tamilnadu, India. Department of Mathematics, SSM Institute of Engineering and Technology, Dindigul, Tamilnadu, India.
2 PG and Research Department of Mathematics, Mannar Thirumalai Naicker College, Madurai, Tamilnadu, India.
Volume: 47Issue: 2Pages: 368–380Year: 2025ISSN: 0970-5120
⬇ Download Full PDF
Abstract
A graph is said to be modulo two square mean labeling, if there is a function from the vertex set of $G$ to $\{1, 2, ..., n\}$ to the edge set of $G$ to $\{1\}$ where $f(uv) = [\frac{f(u)^2 + f(v)^2}{2}] \pmod 2$. A graph that admits modulo two square mean labeling is called modulo two square mean graphs. In this paper we prove that hurdle graphs, comb graphs and $F(P_n)$ graphs are modulo two square mean labeling and its algorithms.
Keywords: Mean Labeling, Root Mean Square Labeling, Hurdle graph, Comb graph
MSC 2020: 05C78 and 05C85
How to Cite
Christopher M., Ramachandran V., MODULO TWO SQUARE MEAN LABELING OF HURDLE GRAPHS, COMB GRAPHS AND $F(P_n)$ GRAPHS AND ITS ALGORITHMS, Journal of the Indian Academy of Mathematics, 47(2) (2025), 368–380.
References
- Acharya B. D, Arumugam S, and Rosa A, Labeling of Discrete Structures and Applications, Narosa Publishing House, New Delhi, 2008.
- Graham R. L and Sloane N. J. A., On additive bases and harmonious graphs, SIAM J. Alg. Discrete Methods, 1, 1980, 382–404.
- Jahir Hussain R and Senthamizh Selvan J, 1-Edge magic labeling of splitting graph, International Journal of Applied Engineering Research, Vol-14, 2019.
- Jayapriya J and Thirusangu K, 0-Edge magic labeling for some class of graphs, Indian Journal of Computer Sciences and Engineering, 3, 2012, 425–427.
- Ponraj R and Somasundaram S, Mean labeling of graphs, National Academy of Science Letters, Vol-26, 2003, 210–213.
- Ramachandran V and Sekar C, One modulo N gracefulness of Acyclic graphs, Ultra Scientist of Physical Sciences, Vol. 25 No (3)A, 2013, 417–424.
- Rosa A, On certain valuations of the vertices of a graph, Theory of Graphs (Internat. Symposium, Rome, July 1966), Gordon and Breach, N. Y. and Dunod Paris, 1967, 349–355.
- Sandhya S, Somasundaram S and Anusa S, Root square mean labeling of graphs, Int. J. Contemp. Math. Sci., 2014.
- Sandhya S, Somasundaram S and Anusa S, Some More Results on Root Square Mean Graphs, J. Math. Res., 2015.
- Selvaraj, R., Vidyanandini, S. & Nayak, Soumya Ranjan, Even vertex odd mean labeling of some graphs, Journal of Discrete Mathematical Sciences and Cryptography, 27:7, 2024, 2169–2177, DOI: 10.47974/JDMSC-2089.
© Journal of the Indian Academy of Mathematics