Odd Graceful Labeling of Super Subdivision of Few Graphs
DOI:
https://doi.org/10.48165/Keywords:
Odd graceful labeling, Star graph, Path, super subdivisionAbstract
Odd graceful labeling was originally introduced by Gnanajothi [3] in 1991. The graph Gdemonstrates Odd graceful labeling as injecting from (G) → {0,1,2, … (2 − 1)} in such a way that whenever the label | ( ) − ( )| is allocated to every edge , the derived edge labels are {1,3,5, … , (2 − 1). This paper demonstrates that the Super subdivision of the star and super subdivision of path permits odd graceful labeling.
References
Eldergill P. (1997). Decomposition of the Complete Graph with an Even Number of Vertices, M. Sc. Thesis, McMaster University.
Gallian J.A. (2020). A dynamic survey of Graph labeling, The Electronic Journal of Combinatorics, (2020), 77-81.
Gnanajothi R.B. (191). Topics in Graph Theory, Ph.D. Thesis, Madurai Kamaraj University.
Kaladevi V. and Backiyalakshmi P (2011). Maximum Distance Matrix of Super Subdivision of Star Graph, J. Comp. & Math. Sci. 2(6), 828-835.
Mahmoud I Moussa, El-Sayed Badr (2009). Odd Graceful labelings of Crown Graphs, 1st Int Conference on Computer Science from Algorithms to Applications (CSAA-2009), Cairo, Egypt, 8-10.
Neela N and Selvaraj C. (2016). Conjecture on odd graceful graphs, J. Combin. Math. Combin. Comput., 97, 65-82.
Rosa A (1967). On certain valuations of the vertices of a graph, Theory of Graphs (International Symposium, Rome, July 1966), Gordon and Breach, N.Y. and Dunod Paris, (1967), 349-355.