Edge Coloring Of Complement Bipolar Fuzzy Graphs

Graph coloring is one of the most important problems of combinatorial optimization. Many problems of practical interest can be modeled as coloring problems. Two types of coloring namely vertex coloring and edge coloring are usually associated with any graph. In this paper, we analyze edge coloring on complement BFGs using concept of as bipolar fuzzy numbers through the cuts of BFGs. For different values of cuts which depend on edge and vertex membership value of the graph, we will get different graph and different chromatic number.