Skip to main content
SpringerLink
Log in

All Uniform Bow Graphs are Graceful

  • Published:
Mathematics in Computer Science Aims and scope Submit manuscript

Abstract

In this paper we define a bow graph to be a double shell in which each shell has any order. We call a bow graph in which each shell has the same order l as a uniform bow graph. We prove that all uniform bow graphs are graceful.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ayel, J., Favaron, O.: Helms are Graceful in Progress in Graph Theory (Waterloo Ont., 1982), pp. 89–92. Academic Press, Toronto (1984)

  2. Deb P., Limaye N.B.: On Harmonious labeling of some cycle related graphs. Ars Comb. 65, 177–197 (2002)

    MathSciNet  Google Scholar 

  3. Delorme C., Maheo M., Thuillier H., Koh K.M., Teo H.K.: Cycles with a chord are graceful. J. Graph Theory 4, 409–415 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  4. Frucht R.: Graceful numbering of wheels and related graphs. Ann. N.Y. Acad. Sci. 319, 219–229 (1979)

    Article  MathSciNet  Google Scholar 

  5. Gallian Joseph, A.: A dynamic survey of graph labeling, 17th edn. Electron. J. Comb. (2014)

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

  7. Goh, C.G., Lim, C.K.: Graceful numbering of cycles with consecutive chords. Electron. J. Comb. 17, 12 (2014)

  8. Kang Q.D., Liang Z.H., Gao Y.Z., Yang G.H.: On the labeling of some graphs. J. Comb. Math. Comb. Comput. 22, 193–210 (1996)

    MATH  MathSciNet  Google Scholar 

  9. Koh K.M., Rogers D.G., Teo H.K., Yap K.Y.: Graceful graphs: some further results and problems. Congr. Number 29, 559–571 (1980)

    MathSciNet  Google Scholar 

  10. Koh K.M., Yap K.Y.: Graceful numberings of cycles with a P 3-chord. Bull. Inst. Math. Acad. Sinica 12, 41–48 (1985)

    MathSciNet  Google Scholar 

  11. Koh K.M., Punnim N.: On graceful graphs: cycles with 3-consecutive chords. Bull. Malays. Math. Soc. 5, 49–63 (1982)

    MATH  MathSciNet  Google Scholar 

  12. Liu R.Y.: On Bodendiek’s conjecture for graceful graphs. Chin. Q. J. Math. 4, 67–73 (1989)

    Google Scholar 

  13. Ma, X.: A graceful numbering of a class of graphs. J. Math. Res. Expo. pp. 215–216 (1988)

  14. Ma X., Liu Y., Liu W.: Graceful graphs: cycles with (t−1) chords. Math. Appl. 9(Suppl.), 6–8 (1990)

    Google Scholar 

  15. Rosa, A.: On certain valuations of the vertices of a graph. In: Theory of Graphs Proceedings of the Symposium, Rome (July 1966), pp. 349–355. Gordon and Breach, New York (1967)

Download references

Author information

Authors and Affiliations

  1. PG Department of Mathematics, Women’s Christian College, Chennai, India

    J. Jeba Jesintha

  2. Department of Mathematics, Ethiraj College for Women, Chennai, India

    K. Ezhilarasi Hilda

Authors
  1. J. Jeba Jesintha
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. Ezhilarasi Hilda
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to J. Jeba Jesintha.

Additional information

To our parents.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jesintha, J.J., Hilda, K.E. All Uniform Bow Graphs are Graceful. Math.Comput.Sci. 9, 185–191 (2015). https://doi.org/10.1007/s11786-015-0224-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11786-015-0224-2

Keywords

Mathematics Subject Classification

Search

Navigation