JUST CHROMATIC EXCELLENCE IN FUZZY GRAPHS

Then 􀀀f is the partition of independent sets of vertices of G in which each sets has the same colour is called the fuzzy chromatic partition. A graph G is called the just f -excellent if every vertex of G appears as a singleton in exactly one f -partition of G. This paper aims at the study of the new concept namely Just Chro- matic excellence in fuzzy graphs. Fuzzy colourful vertex is dened and studied. We explain these new concepts through examples.