Parvathi, A2017-03-312017-03-312013https://ir.avinuty.ac.in/handle/avu/2492For a graph Gk = (U o, p,), a fuzzy coloring function assigns values to each of the vertices and edges in such a way that no two adjacent vertices and incident edges share the same color. In this paper we introduce the concept of k-fuzzy total coloring on a complete fuzzy graph. We determine the chromatic number for a complete fuzzy graph Gk, with fuzzy set of vertices and fuzzy set of edges in terms of family of fuzzy sets.