JUST CHROMATIC EXCELLENCE IN ANTI-FUZZY GRAPHS

Abstract

The least value of k for which the  has a k-vertex coloring denoted by , is called the chromatic number of the anti-fuzzy graph . Then  is the partition of independent sets of vertices of  in which each set has the same color is called the chromatic partition. An anti-fuzzy graph  is called the just-excellent if every vertex of  appears as a singleton in exactly one-partitions of . A just - excellent graph of order n is called the tight just -excellent graph if G having exactly n, -partition.The focal point of this paper is to study the new concept called just chromatic excellence and tight just chromatic excellence in anti-fuzzy graphs. We explain these new concepts through illustrative examples.