Keywords:-
Article Content:-
Abstract
Let G (connected, undirected, simple and non-trivial graph with p vertices and q edges. Let f be an injective function f: V(G) } and g be an injective function g: E(G) .Then the graph G is said to be (s, d) magic labeling if is a constant, for all . A graph G is called (magic graphif it admits magic labeling. In this paper the existence of (s, d) magic labeling of subdivision on some special trees are found.
References:-
References
Gallian, J. A. (2018). A Dynamic Survey Of Graph Labeling. Electronic Journal Of Combinatorics, 1(Dynamicsurveys), Ds6.
Sumathi, P., & Kumar, J. S. (2022). Fuzzy Quotient-3 Cordial Labeling On Some Subdivision Graphs.
Babu, C. S., & Diwan, A. A. (2008). Subdivisions Of Graphs: A Generalization Of Paths And Cycles. Discrete Mathematics, 308(19), 4479-4486.
Somasundaram, S., Sandhya, S. S., & Viji, S. P. (2015). Geometric Mean Labeling Of Graphs Obtained By Subdividing Quadrilateral Snakes. Journal Of Combinatorics, Information & System Sciences, 40(1-4), 145.
Sumathi, P., & Mala, P. (2023). (S, D) Magic Labeling Of Some Trees. Mathematical Statistician And Engineering Applications, 72(1), 1895-1904.
Sugeng, K. A., & Miller, M. (2008). On Consecutive Edge Magic Total Labeling Of Graphs. Journal Of Discrete Algorithms, 6(1), 59-65.
Maowa, J. (2016). Study on graceful labeling of trees.
Deshmukh, U., & Shaikh, V. Y. (2016). Mean cordial labeling of tadpole and olive tree. Annals of pure and applied Mathematics, 11(2), 109-116.
Shrimali, N. P., & Rathod, A. K. (2020). Vertex-Edge Neighborhood Prime Labeling Of Some Trees. South East Asian Journal Of Mathematics And Mathematical Sciences, 16(03), 207-218.
Ramachandran, V., & Sekar, C. (2014). One modulo N gracefulness of regular bamboo tree and coconut tree. International Journal on Applications of Graph Theory in wireless Ad Hoc Networks and Sensor Networks, 6(2), 1.