1Department of Information Science and Engineering, B I E T, Davangere - 577 004, Karnataka, India.
2Department of Computer Science and Engineering, B I E T, Davangere - 577 004, Karnataka, India.
In this paper we consider edge coloring of a fuzzy graph. Analogous to vertex coloring given in [4], we introduce the concepts of (d, f) extended k-coloring and (d, f) edge chromatic number. With examples, we show that some of the results of edge coloring of a crisp graph do not carry over to our set up. We also develop an algorithm for determining the (d, f) edge chromatic number of a fuzzy graph.
Fuzzy graph, Edge coloring of a fuzzy graph