Edgecoloring of a Fuzzy Graph

Ramaswamy, V.
March 2009
Advances in Fuzzy Mathematics;2009, Vol. 4 Issue 1, p49
Academic Journal
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.


Related Articles

  • Fuzzy Ideals and Fuzzy Filters of Ordered Ternary Semigroups. Chinram, Ronnason; Sompob Saelee // Journal of Mathematics Research;Feb2010, Vol. 2 Issue 1, p93 

    The notion of ternary semigroups was introduced by Lehmer in 1932 and that of fuzzy sets by Zadeh in 1965. Any semigroup can be reduced to a ternary semigroup but a ternary semigroup does not necessarily reduce to a semigroup. A partially ordered semigroup T is called an ordered ternary...

  • Anti M-Fuzzy Subgroup and its Lower Level M-Subgroups. Sundararajan, P.; Muthuraj, R. // International Journal of Computer Applications;Jul2011, Vol. 26, p32 

    In this paper, we introduce the concept of an anti M-fuzzy subgroup of an M-group and lower level subset of an anti Mfuzzy subgroup and discussed some of its properties.

  • A New Structure and Construction of Q- Fuzzy Groups. Solairaju, A.; Nagarajan, R. // Advances in Fuzzy Mathematics;2009, Vol. 4 Issue 1, p23 

    In this paper, we fuzzify the new class of algebraic structures introduced by (5,9). In this fuzzification, we introduce the notion of Q- fuzzy groups (QFG) and investigate some of their related properties. The purpose of this study is to implement the fuzzy set theory and group theory in Q-...

  • Strongly Almost Convergent Classes of Sequences of Fuzzy Numbers Generated by Infinite Matrices Defined By A Modulus Function. Esi, Ayhan // Advances in Fuzzy Mathematics;2009, Vol. 4 Issue 1, p31 

    In this paper, we introduce and examine some new almost convergent classes of sequences of fuzzy numbers by using the A-transforms and a modulus function. We also examine topological properties and some inclusion relations for these new classes of sequences of fuzzy numbers.

  • A GREATER KNOWLEDGE EXTRACTION CODED AS FUZZY RULES AND BASED ON THE FUZZY AND TYPICALITY DEGREES OF THE GKPFCM CLUSTERING ALGORITHM. Ojeda-Magaña, B.; Ruelas, R.; Buendía-Buendía, F. S.; Andina, D. // Intelligent Automation & Soft Computing;Dec2009, Vol. 15 Issue 4, p555 

    This work proposes a method to generate a greater and bigger knowledge from a data set. The GKPFCM clustering algorithm is used for that. So, for a given number of clusters it identifies their location and their approximate shape. The relations among the variables of the data set can be found...

  • On Fuzzy Nearly Compact Regular Open Topology. Ray, A. Deb; Chettri, Pankaj // Advances in Fuzzy Mathematics;2009, Vol. 4 Issue 1, p59 

    In this paper, the concept of a new fuzzy topology called fuzzy nearly compact regular open topology on a collection of functions, F, from a fuzzy topological space ( fts , for short) X to another fts Y (denoted by FNR) is introduced and studied. It is observed that the fuzzy GS - T2 -ness...

  • Fuzzy Shortest Path For Steiner Tree Problem. Nagoorgani, A.; Begam, A. Mumtaj // International Journal on Computer Science & Engineering;2011, Vol. 3 Issue 4, p1616 

    In this paper, a modification of the shortest path approximation based on the fuzzy shortest paths evaluations. The Steiner tree problem on a graph in which a fuzzy number instead of a real number is assigned to each edge. Here, to solve the fuzzy shortest path using a new approach ranking method.

  • Complementary Nil Domination in Interval-valued Intuitionistic Fuzzy Graph. Mehra, Seema; Singh, Manjeet // General Mathematics Notes;Nov2015, Vol. 31 Issue 1, p61 

    The aim of this paper is to introduce the concept of complementary nil domination in interval-valued intuitionistic fuzzy graph and to obtain some results related to this concept.

  • Clustering Using Strong Arcs in Fuzzy Graphs. Sameena, K. // General Mathematics Notes;Sep2015, Vol. 30 Issue 1, p60 

    The clustering method based on the connectedness concepts in fuzzy graph is discussed. In [8] R.T Yeh and S.Y Bang introduced the concept of clusters using reachability matrix of a fuzzy graph. This technique is modified using strong arcs in fuzzy graphs.


Read the Article


Sign out of this library

Other Topics