ISSN ONLINE(2319-8753)PRINT(2347-6710)
Square Graceful Labeling of Some Graphs
A ð‘Â. ð‘ž graph G = ð‘‰, ð¸ is said to be a square graceful graph ifthere exists an injective function f: V ðº → 0,1,2,3, … , ð‘ž2 such that the induced mapping ð‘“ð‘ : E ðº → 1,4,9, … , ð‘ž2 defined by ð‘“ð‘ ð‘¢ð‘£ = ð‘“ ð‘¢ − ð‘“ ð‘£ is an injection. The function f is called a square graceful labeling of G. In this paper the square graceful labeling of the caterpillar S ð‘‹1, ð‘‹2, … , ð‘‹ð‘› , the graphs ð‘ƒð‘› −1 1,2, … ð‘› ,mð¾1,ð‘› ∪ ð‘ ð¾1,ð‘¡ , ð¾1,ð‘– , ð‘›ð‘– =1 ð‘ƒð‘› ⨀ð¾1 − ð‘’,H graph and some other graphsare studied. A new parameter called star square graceful deficiency number of a graph is defined and the star square graceful deficiency number of the cycle ð¶3 is determined. Two new definitions namely, odd square graceful labeling and even square graceful labeling of a graph are defined with example.
K.Murugan
To read the full article Download Full Article | Visit Full Article