Fuzzy Total Coloring and Chromatic Number of a Complete Fuzzy Graph

Simple item page
dc.categoryJournal Article
dc.contributor.authorParvathi, A
dc.date.accessioned2017-03-31T23:54:40Z
dc.date.available2017-03-31T23:54:40Z
dc.date.issued2013
dc.departmentMathematicsen_US
dc.description.abstractFor 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.en_US
dc.identifier.urihttps://ir.avinuty.ac.in/handle/avu/2492
dc.langEnglishen_US
dc.publisher.nameInternational Journal of Emerging Trends In Engineering And Developmenten_US
dc.publisher.typeInternationalen_US
dc.titleFuzzy Total Coloring and Chromatic Number of a Complete Fuzzy Graphen_US
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
maths_2013_002.pdf
Size:
2.27 MB
Format:
Adobe Portable Document Format
Download
Collections
Journal Article