Journal of Advanced Artificial Intelligence |
Foundation of Computer Science (FCS), NY, USA |
Volume 1 - Number 6 |
Year of Publication: 2025 |
Authors: G. Sangeetha |
![]() |
G. Sangeetha . Two Modulo Three Graceful Labeling of Some Special Graphs. Journal of Advanced Artificial Intelligence. 1, 6 ( Mar 2025), 28-30. DOI=10.5120/jaai202430
A function f is called a two modulo three graceful labeling of a graph G if f : V (G) → {2, 5, 8, 11, 14, . . . , 3q+8} is injective and the induced function f ∗ : E(G) → {3, 6, 9, . . . , 3q} defined as f ∗(uv) = |f (u) − f (v)| is bijective. A graph which admits two modulo three graceful labeling is called a two modulo three graceful graph. This paper discuss about the two modulo three graceful labeling for the graphs such as ladder graph, coconut tree, bistar graph, twig graph, regular caterpillar tree etc.