Research Article

Two Modulo Three Graceful Labeling of Some Special Graphs

by  G. Sangeetha
journal cover
Journal of Advanced Artificial Intelligence
Foundation of Computer Science (FCS), NY, USA
Volume 1 - Issue 6
Published: March 2025
Authors: G. Sangeetha
PDF

G. Sangeetha . Two Modulo Three Graceful Labeling of Some Special Graphs. Journal of Advanced Artificial Intelligence. 1, 6 (March 2025), 28-30.

                        @article{ placeholder_doi,
                        author  = { G. Sangeetha },
                        title   = { Two Modulo Three Graceful Labeling of Some Special Graphs },
                        journal = { Journal of Advanced Artificial Intelligence },
                        year    = { 2025 },
                        volume  = { 1 },
                        number  = { 6 },
                        pages   = { 28-30 },
                        
                        publisher = { Foundation of Computer Science (FCS), NY, USA }
                        }
                        %0 Journal Article
                        %D 2025
                        %A G. Sangeetha
                        %T Two Modulo Three Graceful Labeling of Some Special Graphs%T 
                        %J Journal of Advanced Artificial Intelligence
                        %V 1
                        %N 6
                        %P 28-30
                        
                        %I Foundation of Computer Science (FCS), NY, USA
Abstract

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.

References
  • S.Ashok kumar and S.Maragathavalli, Prime Labeling of Some Special Graph, ISOR J. Math., 11 (1) (2015), 1-5.
  • J. A. Gallian, A dynamic Survey of graph labeling, The Electronics J. Combi- natorics, 17 (2014), 1-384.
  • F. Hararay and A.J.Schwenk, The number of Caterpillars, Discrete Math., 6(1973), 359-365.
  • F.Haray, Graph Theory, Narosa Publishing House Reading, New Delhi, (1988).
  • H.Hosaya and F.Harary, On the matching properties of three fence graphs, J. Math. Chem., 12 (1993), 211-218.
  • N. Murugesan and R. Uma, Super vertex gracefulness of some special graphs, IOSR J. Math., 11(3)(2015), 7-15.
  • V.Ramachandran and C.Sekar, 1 modulo N gracefulness of regular bamboo tree and coconut tree, GRAPH-HOC, 6(2)(2014), 1-10.
  • A .Rosa, On certain valuation of the vertices of a graph,Theory of Graphs, (International Symposium,Rome,July 1966), Gordon and Breach, N.Y. and Dunod, Paris, 1967, pp. 349-355.
  • A.Sasikala and V.Poovila , Two Modulo Three Graceful Labeling Of Bipartite Graph, Adv. Appl. Math. Sci.,, 21(10)(2022), 5989 - 5996.
  • A.Solairaju C.Vimala and A.Sasikala, Edge-odd Graceful Labeling of the Graph S2 ⊙ Sn, Int. J. Comput. Appl., 9(12)(2010),
  • P.Sumathi and A.Rathi Quotient Labeling of Some Ladder Graph, Amer. J. Engg. Res., (7)(12), 38-42.
  • N.Udhayakumar and N.Ramya, On Prime Labeling of Some Trees, Malaya J. Matematik, (2)(2020), 4042-4045
  • C.Velmurgan and V.Ramachandran, M modulo N graceful labeling of path and star, J. Inform. Comput. Sci., 9(12)(2019), 1212-1221.
  • C.Vimala and V.Poovila, Two Modulo Three Graceful Labeling Of Some Graphs, Adv. Appl. Math. Sci., 21(6)(2022), 3105 - 3118.
Index Terms
Computer Science
Information Sciences
No index terms available.
Keywords

Special Graphs

Powered by PhDFocusTM