COLORING OF BIFUZZY GRAPHS

Abstract

In this paper, we introduce coloring function of a bifuzzy edge graph G = (V, B) using (α, β)-cuts of G and determine the chromatic number of G.  We compute k-coloring of bifuzzy graph G̃ = (V, A, B) based on the family of bifuzzy sets on V.  We establish strong coloring of a bifuzzy graph and compute strong chromatic number.  We also present a new channel assignment problem by using a bifuzzy graph.