Graceful Labeling for Plus Graph

Main Article Content

V J Kaneria
H M Makadia

Abstract

We investigate a new graph which is called plus graph. We proved that the plus graph is graceful. We have investigated
some plus graph related families of connected graceful graphs. We proved that path union of plus graph, cycle of plus
graph and star of plus graph are graceful.

Article Details

How to Cite
Kaneria, V. J. . and Makadia, H. M. (2015) “Graceful Labeling for Plus Graph”, International Journal of Current Research in Science and Technology, 1(03). Available at: https://ijcrst.in/index.php/ijcrst/article/view/78 (Accessed: 5 May 2024).
Section
Original Research Articles

References

A.Rosa, On certain valuation of graph, Theory of Graphs (Rome, July 1966), Goden and Breach, N. Y. and Paris, (1967),

-355.

S.W.Golomb, How to number a graph, Graph Theory and Computing (R. C. Read. Ed.), Academic Press, New York,

(1972), 23-37.

F.Harary, Graph theory, Addition Wesley, Massachusetts, (1972).

V.J.Kaneria, H.M.Makadia and M.M.Jariya, Graceful labeling for cycle of graphs, Int. J. of Math. Res., 6(2)(2014),

-139.

S.K.Vaidya, S.Srivastav, V.J.Kaneria and G.V.Ghodasara, Cordial and 3????equitable labeling of star of a cycle, Mathe-

matics Today, 24 (2008), 54-64.

V.J.Kaneria and H.M.Makadia, Graceful labeling for Double Step Grid Graph, I. J. of Math. And its App., 3(1)(2015),

-38.

J.A.Gallian, A Dynamic Survey of Graph Labeling ,The Electronics Journal of Combinatorics, 17(2014), #DS6.