Loading...
Search
| Friend's email | |
| Your name | |
| Your email | |
| enter code | |
This page was sent successfuly
Digital Object List
Bookmark
Review List
947 viewed
رنگ آمیزی هارمونیوس گراف
افلاکی، آرین Aflaki, Arian
- Type of Document: M.Sc. Thesis
- Language: Farsi
- Document No: 43996 (02)
- University: Sharif University of Technology
- Department: Mathematical Sciences
- Advisor(s): Jafari, Amir
- Abstract:
- 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
- Keywords:
- Harmonious Coloring ; Harmonious Number ; Graph Coloring
-
محتوي پايان نامه
- view