Skip to main content
SpringerLink
Log in

Harmonious Coloring on Corona Product of Complete Graphs

  • Short Communication
  • Published:
National Academy Science Letters Aims and scope Submit manuscript

Abstract

In this paper, we find the harmonious chromatic number of the corona product of any graph \(G\) of order \(l\) with the complete graph \(K_n\) for \(l \le n\). As a consequence of this work, we also obtain the harmonious chromatic number of \(t\) copies of \(K_n\) for \(t \le n+1\).

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

References

  1. Aflaki A, Akbari S, Edwards KJ, Eskandani DS, Jamaali M, Ravanbod H (2012) On harmonious colouring of trees. Electron J Comb 19(1):1–9

    Google Scholar 

  2. Frank O, Harary F, Plantholt M (1982) The line distinguishing chromatic number of a graph. Ars Comb 14:241–252

    Google Scholar 

  3. Georges JP (1995) On harmonious colouring of collection of graphs. J Gr Theory 20(2):241–245

    Article  Google Scholar 

  4. Harary F, Plantholt M (1983) Graphs with the line distinguishing chromatic number equal to the usual one. Util Math 23:201–207

    Google Scholar 

  5. Hopcroft J, Krishnamoorthy MS (1983) On the harmonious colouring of graphs. SIAM J Algebra Discret Math 4:306–311

    Article  Google Scholar 

  6. Jensen TR, Bjarne T (1995) Graph coloring problems. Wiley-Interscience, New York

    Google Scholar 

  7. Kubale M (2004) Graph colourings. American Mathematical Society Providence, Rhode Island

    Book  Google Scholar 

  8. Edwards KJ (1997) The harmonious chromatic number and the achromatic number. In: Bailey RA (ed) Surveys in Combinatorics 1997 (Invited papers for 16th British Combinatorial Conference). Cambridge University Press, Cambridge, pp 13–47

    Chapter  Google Scholar 

  9. Wilson B (1990) Pitman research notes in mathematics 218. In: Nelson R, Wilson RJ (eds) Line distinguishing and harmonious colourings, graph colouring. Longman Scientific and Technical, Essex

    Google Scholar 

  10. Edwards KJ (1995) The harmonious chromatic number of almost all trees. Comb Probab Comput 4:31–46

    Article  Google Scholar 

  11. Edwards KJ (1996) The harmonious chromatic number of bounded degree trees. Comb Probab Comput 5:15–28

    Article  Google Scholar 

  12. Edwards KJ (1999) The harmonious chromatic number of complete \(r\)-ary trees. Discret Math 203:83–99

    Article  Google Scholar 

  13. Edwards KJ, McDiarmid CJH (1995) The complexity of harmonious colouring for trees. Discret Appl Math 57:133–144

    Article  Google Scholar 

  14. Mammana MF (2003) On the harmonious chromatic number of P(\(\alpha, K_n\)), P(\(\alpha, K_{1, n}\)) and P(\(\alpha, K_{m, n}\)). Util Math 64:25–32

    Google Scholar 

  15. Lu Z (1993) Estimates of the harmonious chromatic numbers of some classes of graphs. J Syst Sci Math Sci 13:218–223

    Google Scholar 

  16. Lu Z (1993) The harmonious chromatic number of a complete binary and trinary tree. Discret Math 118:165–172

    Article  Google Scholar 

  17. Lu Z (1995) The harmonious chromatic number of a complete \(4\)-ary tree. J Math Res Expos 15:51–56

    Google Scholar 

  18. Lu Z (1997) The exact value of the harmonious chromatic number of a complete binary tree. Discret Math 172:93–101

    Article  Google Scholar 

  19. Lu Z (1998) Exact value of the harmonious chromatic number of a complete trinary tree. Syst Sci Math Sci 11:26–31

    Google Scholar 

  20. Klavzar S, Hammack R, Imrich W (2011) Handbook of graph products. CRC Press, Boca Raton

    Book  Google Scholar 

  21. Frucht R, Harary F (1970) On the corona of two graphs. Aequ Math 4:322–325

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graph Theory and Applications Research Group, Faculty of Engineering and Built Environment, School of Electrical Engineering and Computer Science, University of Newcastle, Callaghan, NSW , 2308, Australia

    Francisco Antonio Muntaner-Batle

  2. Department of Mathematics, University College of Engineering (Anna University Constituent College), Konam, Nagercoil , 629 004, Tamil Nadu, India

    J. Vernold Vivin

  3. Department of Mathematics, RVS Faculty of Engineering, RVS Educational Trust’s Group of Institutions, Coimbatore , 641 402, Tamil Nadu, India

    M. Venkatachalam

Authors
  1. Francisco Antonio Muntaner-Batle
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Vernold Vivin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Venkatachalam
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to J. Vernold Vivin.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Muntaner-Batle, F.A., Vernold Vivin, J. & Venkatachalam, M. Harmonious Coloring on Corona Product of Complete Graphs. Natl. Acad. Sci. Lett. 37, 461–465 (2014). https://doi.org/10.1007/s40009-014-0256-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s40009-014-0256-1

Keywords

Search

Navigation