Some Results on Generating Graceful Trees

  • Authors

    • S. Venkatesh
    • K. Balasubramanian
    2018-10-02
    https://doi.org/10.14419/ijet.v7i4.10.21283
  • Trees, Graceful labeling, Recursive attachment.

  • Abstract

    Let  and  be any two simple graphs. Then  is the graph obtained by merging a vertex of each copy of  with every attachment vertices of . Let  be the one vertex union of copies of the given caterpillar  with the common vertex as one of the penultimate vertices. If  is any caterpillar, then define . Recursively for , construct ,that is,   Here the tree  considered for attachment with  is a caterpillar, but not necessarily the same among the levels. In this paper we prove that the tree  is graceful for

     

  • References

    1. [1] Golomb.S.W, How to number a graph in graph theory and computing. In: Read R.C. (ed.) Academic Press, New York, (1972), 23-37.

      [2] Rosa.A, On certain valuations of the vertices of a graph, Theory of Graphs International Symposium, Rome, July) Gordon and Breach, N.Y. and Dunod Paris, (1966), 105-110.

      [3] Stanton.R and Zarnke.C, Labeling of balanced trees, Proc. 4th Southeast Conf.Combin., Graph Theory, Comput., (1973), 479-495.

      [4] Bahl. P, Lake.S and Wertheim.A, Gracefulness of families of spiders, Involve 3 (2010), 241-247.

      [5] Burzio.M and Ferraeese.G, The subdivision of a graceful tree is a graceful tree, Discrete Math, 181 (1988), 275-281.

      [6] Chen.W.C, Lu.H.I. and Yeh, Operations of interlaced trees and graceful trees, Southeast Asian Bull. Math., 21 (1997), 337-348.

      [7] Gallian.J.A, A dynamic survey of Graph labeling, The Electronic Journal of Combinatorics,, DS6 (2017).

      [8] Koh.K.M, Rogers.D.G..and Tan. T, Product of graceful trees, Discrete Math., 31 (1980), 2790-292.

      [9] Poljak.S and Sura.M, An algorithm for graceful labeling of a class of symmetrical trees, Ars Combin., 14 (1982), 57-66.

      [10] Sethuraman.G and Jesintha.J, All extended banana trees are graceful, Proc.Internat. Conf. Math. Comput. Sci., 1 (2009), 4-8.

      [11] Sethuraman.G and J. Jesintha, All banana trees are graceful, Advances Appl. Disc. Math.,, 4 (2009), 53-64.

      [12] Sethuraman.G and J.Jesintha.J, A new class of graceful lobsters, J. Combin. Math. Combin. Computing, 67 (2008), 99-109.

      [13] Sethuraman.G and P. Ragukumar.J, Every Tree is a subtree of Graceful Tree, Graceful Graph and Alpha-labeled Graph, Ars Comb., 132 (2017), 27-47.

      [14] Sethuraman.G and Venkatesh. S, Decomposition of complete graphs and complete bipartite graphs into alpha labelled trees, Ars Combinatoria, 93 (2009), 371-385.

      [15] S. Venkatesh, Bharathi.S, On generating Graceful trees, International Journal of Pure and Applied Mathematics, 118(9), 2018, 899-904.

  • Downloads

  • How to Cite

    Venkatesh, S., & Balasubramanian, K. (2018). Some Results on Generating Graceful Trees. International Journal of Engineering & Technology, 7(4.10), 570-572. https://doi.org/10.14419/ijet.v7i4.10.21283

    Received date: 2018-10-08

    Accepted date: 2018-10-08

    Published date: 2018-10-02