f-COLORINGS OF SOME COMPLETE TRIPARTITE GRAPHS
An f-coloring of G is an edge coloring of G such that each v ∈ V incidences with at most f(v) same-colored edges. The f-chromatic index of G is the minimum number of colors used for an f-coloring of G. A graph can be specified into the class Cf1 or Cf2 based on its f-chromatic index. In th...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| التنسيق: | Final Project |
| اللغة: | Indonesia |
| الوصول للمادة أونلاين: | https://digilib.itb.ac.id/gdl/view/16546 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| المؤسسة: | Institut Teknologi Bandung |
| اللغة: | Indonesia |
| الملخص: | An f-coloring of G is an edge coloring of G such that each v ∈ V incidences with at most f(v) same-colored edges. The f-chromatic index of G is the minimum number of colors used for an f-coloring of G. A graph can be specified into the class Cf1 or Cf2 based on its f-chromatic index. In this final project, we consider the f-colorings on tripartite graphs which are graphs with the set of vertex can be partitioned into three subsets so that no two neighboring vertices in the same subset. The results obtained are the characterization of a subclass of tripartite graphs with certain f function based on their f-chromatic index. |
|---|