Fuzzy Total Coloring and Chromatic Number of a Complete Fuzzy Graph
No Thumbnail Available
Date
2013
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
For 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.