Loading...

Harmonious Coloring of Graph

Aflaki, Arian | 2013

433 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 43996 (02)
  4. University: Sharif University of Technology
  5. Department: Mathematical Sciences
  6. Advisor(s): Jafari, Amir
  7. Abstract:
  8. Let G be a simple graph. A harmonious coloring of G is a proper vertex coloring such that each pair of colors appears together on at most one edge. The harmonious chromatic number, h(G), is the least number of colors in such a coloring. In this project, first we discuss about complexity of harmonious coloring. Then we find some bounds for harmonious chromatic number
  9. Keywords:
  10. Harmonious Coloring ; Harmonious Number ; Graph Coloring

 Digital Object List

  • محتوي پايان نامه
  •   view