Asia Mathematika

Volume 1, Issue 1, August 2017, pp 7-22

Graceful Labeling for different path and complete Bi-partite using Padavon sequence

A.Neerajah ¹ and P.Subramanian²

¹Department of Mathematics, Karpagam University, Coimbatore-641021, India.
²Department of Mathematics, Government Arts College, Coimbatore-641018, India.

Abstract

A path of length n is denoted by P_n. A function f is a graceful labeling of a graph G with p vertices and q edges, if f is injection from the vertices of G to the set {1 , 2 , … , q} such that when each edge uv is assigned the label |f(u)-f(v)| is distinct. In this paper, the gracefulness of padavon sequence for paths P_n for n=1 to 3 is obtained and gracefulness of padavon sequence for paths with two pendent vertices P_n for n=1 to 5 and complete bi-partite are obtained.

Keywords

Complete bipartite, Graceful labeling, path, padavon sequence.

Preview

Reference

1. Beinke. L.W and Hegde. S.M , (2001) Strong multiplicative graphs, Discuss.Math.Graph Theory, 21, 63-75

2. Frank Harrary, (2001), Graph theory, Addison-Wesley Publishing company.

3. Gallian.G.J., (2009), A dynamic survey of graph labeling, The electronic journal of combinatorics,

4. Gnanajothi. R.B, (1991), Topics in Graph Theory, Ph.D.Thesis, Madurai Kamaraj University.

5. Gross. J and Yellen. J, (1999), Graph theory and its applications, CRC Press.

6. Rosa. A, (1967), On certain valuations of the vertices of a graph, Theory of graphs (International Symposium, Rome),.

7. Perumal.M.A, Navaneethakrishnan.S, Nagarajan. A and Arockiaraj S, (2014) Super Graceful Labeling for Some Special Graphs ,International journal of Mathematical Archive.

8. Solairaju. A and Muruganantham. P, (2008) ,Even-edge gracefulness of ladder, The Global Journal of Applied Mathematics & Mathematical Sciences(GJ-AMMS). Volume 1. Number 2, (July-December), 149-153.

9. Uma Maheswari.S, (2015), Graceful Labeling of the paths using padavon sequence, International Journal of Mathematical Archive-4(4), 013, 66-71.

10. Uma Maheswari.S, (2015), Edge Odd graceful labeling of the paths using padavon sequence, International Journal of computer applications.