Upcoming SlideShare
×

Thanks for flagging this SlideShare!

Oops! An error has occurred.

×
Saving this for later? Get the SlideShare app to save on your phone or tablet. Read anywhere, anytime – even offline.
Standard text messaging rates apply

# An upperbound for fuzzy chromatic number of fuzzy graph

774

Published on

0 Likes
Statistics
Notes
• Full Name
Comment goes here.

Are you sure you want to Yes No
Your message goes here
• Be the first to comment

• Be the first to like this

Views
Total Views
774
On Slideshare
0
From Embeds
0
Number of Embeds
0
Actions
Shares
0
24
0
Likes
0
Embeds 0
No embeds

No notes for slide

### Transcript

• 1. AKCE Int. J. Graphs Comb., X, No. X (XXXX), pp. 1-12 AN UPPER BOUND FOR FUZZY CHROMATIC NUMBER OF FUZZY GRAPHS AND THEIR COMPLEMENT Isnaini Rosyida Ph.D Student at Department of Mathematics, GadjahMada University, Indonesia Department of Mathematics, Semarang State University, Indonesia e-mail: iisisnaini@gmail.com S.Lavanya Department of Mathematics, D.G. Vaishnav College, Chennai, Tamilnadu, India e-mail: lavanyaprasad1@gmail.com Widodo, Ch.R.Indrati Department of Mathematics, GadjahMada University, Indonesia K.A.Sugeng Department of Mathematics, University of Indonesia, Indonesia Abstract An upper bound for the sum and product of chromatic number of a crisp graph and chromatic number of its complement has been given by Nordhaus and Gaddum. On the other hand, Sattanathan and Lavanya gave a theorem about un upper bound for the sum and product of fuzzy chromatic number of a fuzzy graph and its complement. In this paper, we give an example that the bounds given by Sattanathan and Lavanya do not hold for certain fuzzy graphs. Further, we add conditions to a fuzzy graph so it satis&#xFB01;es the theorem of Sattanathan and LavanyaKeywords: Chromatic Number, Fuzzy Coloring, Fuzzy graph, Fuzzy Chromatic Num-ber, Complement Fuzzy graph 2000 Mathematics Subject Classi&#xFB01;cation: 1. Introduction Let G be a graph with vertex set V(G) and edge set E(G). Vertex coloring of G is amapping C : V (G) &#x2192; N with N is a set of natural numbers, such that C(x) = C(y)if (x, y) &#x2208; E(G) . Given an integer k , a k -coloring of G is a mapping C : V (G) &#x2192;{1, 2, ..., k} such that C(x) = C(y) if (x, y) &#x2208; E(G) . The chromatic number of G ,denoted by &#x3C7;(G) is the smallest integer k such that there is a k -coloring of G . Forsimplicity, we will use symbol V for V (G) and E for E(G) .
• 2. 2 An Upper of fuzzy chromatic number of Fuzzy graphs and their Complement Vertex coloring of graph G can be interpreted as a problem of special kind of partitionof the vertex set as in [1]. Therefore there is another de&#xFB01;nition of vertex coloring as follows.A color partition of general graph G(V, E) is a partition of V into subsets, called color-classes, such that V = V1 &#x222A; V2 &#x222A; ... &#x222A; Vk where the subsets Vi ( 1 &#x2264; i &#x2264; k ) are non-emptyand mutually disjoint, and each Vi contains no pair of adjacent vertices. The chromaticnumber of G is the smallest natural number k for which such a partition is possible. The Fuzzy set theory has been introduced by Zadeh in 1965 [10]. Ideas of fuzzy settheory have been introduced into graph theory by Rosenfeld in 1975 as in [5]. We calla graph G(V, E) by crisp graph. Rosenfeld has expanded the crisp graph G(V, E) into &#x2DC;fuzzy graph G(V, &#x3C3;, &#xB5;) that is a graph which has fuzzy vertex set with the membershipfunction &#x3C3; : V &#x2192; [0, 1] and fuzzy edge set with the membership function &#xB5; : E &#x2192; [0, 1] . &#x2DC;While Kaufman has introduced a fuzzy graph G(V, &#x3C3;, &#xB5;) that is a graph with crisp vertexset and fuzzy edge set as in [6]. &#x2DC; The vertex coloring of a fuzzy graph G(V, &#x3C3;, &#xB5;) was introduced by Munoz et al [6].Munoz expanded the concept of coloring function C : V &#x2192; N of a crisp graph into coloringfunction Cd,f : V &#x2192; S of a fuzzy graph, where S is the available color set, d is a distancefunction de&#xFB01;ned between the colors on S, and f is a real scale function de&#xFB01;ned on image( &#xB5; ). Pourpasha and Soheilifar [7] expanded the coloring function C d,f : V &#x2192; S of fuzzy &#x2DC; &#x2DC;graph G(V, &#xB5;) into the coloring function Cd,f,g : V &#x2192; S of a fuzzy graph G(V, &#x3C3;, &#xB5;)where g is a real scale function de&#xFB01;ned on image ( &#x3C3; ). Further, the fuzzy vertex coloring &#x2DC;of a fuzzy graph G(V, &#x3C3;, &#xB5;) was de&#xFB01;ned by Eslahchi and Onagh [2]. They de&#xFB01;ned fuzzyvertex coloring of a fuzzy graph through fuzzy color-classes of V . Several authors have studied the problem of obtaining an upper bound for the chromaticnumber of complementary crisp graphs and complementary fuzzy graphs. According toSattanathan and Lavanya as in [8], Nordhaus and Gaddum gave the &#xFB01;rst theorem aboutan upper bound for crisp graph and its complement in 1956. While Sattanathan and La-vanya [8] gave an upper bound for the sum and product of the fuzzy chromatic number ofcomplementary fuzzy graphs. Moreover, Lavanya and Sattanathan [4] gave the de&#xFB01;nitionof fuzzy vertex coloring of fuzzy graph with slight modi&#xFB01;cations. In this paper we give anexample of fuzzy graphs which do not satisfy the theorem of Sattanathan and Lavanya.We also give some theorems on fuzzy chromatic number of fuzzy cycle and its comple-ment. Further, we add conditions to a fuzzy graph such that it satis&#xFB01;es the theorem ofSattanathan and Lavanya. 2. Preliminaries We review brie&#xFB02;y some de&#xFB01;nitions in fuzzy sets as in [10]. Let X be a space of objects.A fuzzy set A on X is the set of the form {(x, &#xB5; A (x)): x &#x2208; X }, where &#xB5;A is a mapping:X &#x2192; [0, 1] . We call &#xB5;A is a membership function of the fuzzy set A , and &#xB5; A (x) at xrepresenting the grade of membership of x in A . Other de&#xFB01;nition said that a fuzzy set A on X is a mapping &#xB5; : X &#x2192; [0, 1] , as in [3].According to the &#xFB01;rst notation, the symbol of the fuzzy set A is distinguished from the
• 3. I.Rosyida, S.Lavanya, Widodo, Ch.R.Indrati, K.A.Sugeng 3symbol of its membership function (&#xB5; A ) . According to the second notation, there is nodistinction between the two symbols. In this paper we use the second notation. A fuzzy set &#xB5; on X is empty if and only if &#xB5;(x) = 0 for all x &#x2208; X . Let &#xB5; and &#x3C3;be fuzzy sets on X. The union &#xB5; &#x222A; &#x3C3; is the fuzzy set on X de&#xFB01;ned by (&#xB5; &#x222A; &#x3C3;)(x) =max{&#xB5;(x), &#x3C3;(x)} for all x &#x2208; X . The intersection &#xB5; &#x2229; &#x3C3; is the fuzzy set on X de&#xFB01;ned by(&#xB5; &#x2229; &#x3C3;)(x) = min{&#xB5;(x), &#x3C3;(x)} for all x &#x2208; X . We review brie&#xFB02;y some de&#xFB01;nitions in fuzzy graphs as in [5], and [9].De&#xFB01;nition 2.1. ([5]) Let V be a &#xFB01;nite nonempty set. Let E &#x2286; V &#xD7; V . A fuzzy graph&#x2DC;G(V, &#x3C3;, &#xB5;) is a graph consisting of a pair of functions (&#x3C3;, &#xB5;) where &#x3C3; is a fuzzy set onV and &#xB5; is a fuzzy set on E, i.e. &#x3C3; : V &#x2192; [0, 1] and &#xB5; : E &#x2192; [0, 1] such that&#xB5;(u, v) &#x2264; min{&#x3C3;(u), &#x3C3;(v)} for all u, v &#x2208; V .Note that a crisp graph G(V, E) is a special case of a fuzzy graph with each vertex andedge of V and E having degree of membership 1. In this paper we refer the de&#xFB01;nition of complement of fuzzy graph as in Sunitha andVijayakumar&#x2019;s paper [9]. &#x2DC; &#xAF; &#x2DC;De&#xFB01;nition 2.2. ([9]) The complement of a fuzzy graph G(V, &#x3C3;, &#xB5;) is a fuzzy graph G =(&#xAF; , &#xB5;) where &#x3C3; = &#x3C3; and &#xB5;(u, v) = min{&#x3C3;(u), &#x3C3;(v)} &#x2212; &#xB5;(u, v) for all u, v &#x2208; V. &#x3C3; &#xAF; &#xAF; &#xAF; &#x2DC; &#x2DC; &#xAF; &#x2DC;De&#xFB01;nition 2.3. ([9]) A fuzzy graph G(V, &#x3C3;, &#xB5;) is self complementary if G = G. The de&#xFB01;nition of adjacency is classify as strong and weak adjacency as in [4]. &#x2DC;De&#xFB01;nition 2.4. ([4]) Two vertices u and v of fuzzy graph G(V, &#x3C3;, &#xB5;) are called strongly 1adjacent if &#xB5;(u, v) &#x2265; 2 min{&#x3C3;(u), &#x3C3;(v)} , otherwise weakly adjacent. Sunitha and Vijayakumar in [9] gave the condition for a fuzzy graph to be self comple-mentary as follows. &#x2DC;Theorem 2.5. ([9]) Let G(V, &#x3C3;, &#xB5;) be a fuzzy graph. If &#xB5;(u, v) = 1 min{&#x3C3;(u), &#x3C3;(v)} for 2all u, v &#x2208; V then G is self complementary. We use the de&#xFB01;nition of fuzzy vertex coloring and fuzzy chromatic number as in [4].De&#xFB01;nition 2.6. ([4]) A family &#x393; = {&#x3B3;1 , &#x3B3;2 , ..., &#x3B3;k } of fuzzy subsets on V is called a &#x2DC;k -fuzzy coloring of G(V, &#x3C3;, &#xB5;) if a. &#x3B3;1 &#x222A; &#x3B3;2 &#x222A; ... &#x222A; &#x3B3;k = &#x3C3; b. min {&#x3B3;i (u), &#x3B3;j (u) | 1 &#x2264; i = j &#x2264; k} = 0 for all u &#x2208; V &#x2DC; c. for every strongly adjacent vertices u, v of G , min{&#x3B3;i (u), &#x3B3;i (v)} = 0 (1 &#x2264; i &#x2264; k).
• 4. 4 An Upper of fuzzy chromatic number of Fuzzy graphs and their Complement &#x2DC; &#x2DC;Fuzzy chromatic number of G is the least value of k for which the fuzzy graph G has &#x2DC;k -fuzzy coloring and is denoted by &#x3C7; F (G). &#xAF; &#x2DC; &#xAF; &#xAF; &#x2DC; Fuzzy chromatic number of the complement G is denoted by &#x3C7;F (G). For simplicity, &#x2DC; &#xAF; &#xAF;we will use symbol &#x3C7;F for &#x3C7;F (G) and &#x3C7;F for &#x3C7;F (G). &#xAF; &#x2DC; &#x2DC; In [4], the authors gave the theorem about strongly adjacent vertices in G correspond &#xAF; &#x2DC;to weakly adjacent vertices in G and vice versa. &#x2DC; &#xAF; &#x2DC;Theorem 2.7. ([4]) Let G(V, &#x3C3; , &#xB5; ) be a fuzzy graph and G = (&#xAF; , &#xB5;) be its complement. &#x3C3; &#xAF; &#x2DC;The vertices u, v &#x2208; V are strongly adjacent in G if and only if u, v are weakly adjacent &#xAF; &#x2DC;in G. The strongly adjacent vertices u, v &#x2208; V in this theorem is restricted to &#xB5;(u, v) &gt;12 min{&#x3C3;(u), &#x3C3;(v)}. Next, we give a lemma on the fuzzy chromatic number of a fuzzy graph which everypair of its vertices are weakly adjacent. &#x2DC;Lemma 2.8. If G(V, &#x3C3;, &#xB5;) is a fuzzy graph which every pair of vertices are weakly adjacent &#x2DC; = 1.then &#x3C7;F (G)Proof. Since every pair of vertices are weakly adjacent then we can construct the family&#x393; which has only one member satisfying all of the conditions in De&#xFB01;nition 2.6. Thus &#x2DC;&#x3C7;F (G) = 1. &#x2DC;The fuzzy graph G as in Lemma 2.8 is called trivial. 3. Main Results In the following, we give a lemma on the fuzzy chromatic number of a fuzzy graph whichevery pair of its vertices are strongly adjacent &#x2DC;Lemma 3.9. If G(V, &#x3C3;, &#xB5;) is a fuzzy graph with n vertices which every pair of vertices &#x2DC;are strongly adjacent then &#x3C7;F (G) = nProof. Let V = {v1 , v2 , ..., vn } . Since every pair of vertices are strongly adjacent then wecan construct the family &#x393; = {&#x3B3;1 , &#x3B3;2 , . . . , &#x3B3;n } where &#x3C3;(xi ), x = xi &#x3B3;i (x) = 0, x = xi we can see that the family &#x393; satisfy the properties a,b,c in De&#xFB01;nition 2.6. This is theminimal fuzzy coloring since any family with less than n members does not satisfy all of &#x2DC;the conditions in De&#xFB01;nition 2.6. Thus &#x3C7; F (G) = n.
• 5. I.Rosyida, S.Lavanya, Widodo, Ch.R.Indrati, K.A.Sugeng 53.1. Fuzzy Chromatic Number of a Fuzzy Cycle and Its Complement In crisp graph case, the chromatic number of even cycle is 2 and the chromatic numberof odd cycle is 3. In the case of fuzzy cycle, we have the fuzzy chromatic number of evencycle is 2 and the fuzzy chromatic number of odd cycle is 2 or 3 which is explained in &#x2DC;Theorem 3.11 and 3.12. In the results below, the fuzzy graph G is not trivial. This &#x2DC;means that G has at least a pair of vertices which are strongly adjacent. First, we give ade&#xFB01;nition on fuzzy cycle &#x2DC;De&#xFB01;nition 3.10. A cycle C in a fuzzy graph G(V, &#x3C3;, &#xB5;) is a sequences of distinct vertices(u0 , u1 , u2 , ..., un ) such that &#xB5;(ui , ui+1 ) &gt; 0 for 1 &#x2264; i &#x2264; n and &#xB5;(uj , uk ) = 0 for k =j + 1 , where u0 = un and n is called the length of C . A cycle C in a fuzzy graph G &#x2DC;can be called by fuzzy cycle. &#x2DC; &#x2DC;Theorem 3.11. If G(V, &#x3C3;, &#xB5;) is a fuzzy cycle with even number of vertices then &#x3C7; F (G) =2. &#x2DC;Proof. Let G(V, &#x3C3;, &#xB5;) be a fuzzy cycle with even number of vertices. Let V = &#x2DC; &#x2DC;{v1 , v2 , ..., vn } where n is even. Since G is not trivial then &#x3C7;F (G) &gt; 1. Further, since G is&#x2DC;a fuzzy cycle then &#xB5;(ui , ui+1 ) &gt; 0 , for 1 &#x2264; i &#x2264; n , and &#xB5;(uj , uk ) = 0 for k = j + 1 . Since1 12 min{&#x3C3;(uj ), &#x3C3;(uk )} = 0 then &#xB5;(uj , uk ) &lt; 2 min{&#x3C3;(uj ), &#x3C3;(uk )} . This means that all ofthe pair of vertices (uj , uk ) with k = j + 1 are weakly adjacent. So that the vertex setV can be partitioned into two sets V1 = {v1 , v3 , v5 , ..., vn&#x2212;1 } and V2 = {v2 , v4 , v6 , ..., vn }where every pair of vertices in Vi are weakly adjacent. Further, we can construct thefamily &#x393; = {&#x3B3;1 , &#x3B3;2 } where &#x3C3;(vi ), if i is odd, i = 1, 3, 5, ..., n &#x2212; 1 &#x3B3;1 (vi ) = 0, if i is even, i = 2, 4, 6, ..., n 0, if i is odd &#x3B3;2 (vi ) = &#x3C3;(vi ), if i is even.Here we can see that the family &#x393; satisfy all of the conditions in De&#xFB01;nition 2.6. This isthe minimal fuzzy coloring since any family with less than 2 members does not satisfy all &#x2DC;of the conditions in De&#xFB01;nition 2.6. Thus &#x3C7; F (G) = 2. &#x2DC;Theorem 3.12. If G(V, &#x3C3;, &#xB5;) is a fuzzy cycle with odd number of vertices then &#x3C7; F (G) = 2 &#x2DC; &#x2DC;if there exists at least a pair of vertices (u k , uk+1 ) which are weakly adjacent, and &#x3C7;F (G) =3 if all of the pair of vertices (ui , ui+1 ) are strongly adjacent for all i = 1, 2, ..., n &#x2212; 1 &#x2DC;Proof. Let G(V, &#x3C3;, &#xB5;) be a fuzzy cycle with odd number of vertices. Let V ={v1 , v2 , ..., vn } where n is odd. We consider two cases.
• 6. 6 An Upper of fuzzy chromatic number of Fuzzy graphs and their ComplementCase 1: There exists at least a pair of vertices (u k , uk+1 ) which are weakly adjacent.Without loss of generality, we assume that v 1 v2 is weakly adjacent. In the same argumentwith the proof of theorem 3.11 the vertex set V can be partitioned into two sets V 1 ={v3 , v5 , ..., vn&#x2212;1 } and V2 = {v1 , v2 , v4 , ..., vn&#x2212;2 , vn } where every pair of vertices in Vi areweakly adjacent. Further, we can construct the family &#x393; = {&#x3B3; 1 , &#x3B3;2 } where &#x3C3;(v), if v &#x2208; V1 &#x3B3;1 (v) = 0, if v &#x2208; V2 . 0, if v &#x2208; V1 &#x3B3;2 (v) = &#x3C3;(v), if v &#x2208; V2The family &#x393; satisfy all of the conditions in De&#xFB01;nition 2.6. This is the minimal fuzzycoloring since any family with less than 2 members does not satisfy all of the conditions &#x2DC;in De&#xFB01;nition 2.6. Thus &#x3C7;F (G) = 2.Case 2: All of the pair of vertices (ui , ui+1 ) are strongly adjacent for all i = 1, 2, ..., n&#x2212;1 . &#x2DC;Since G has odd number of vertices then the vertex set V can be partitioned into threesets V1 = {v1 , v3 , v5 , ..., vn&#x2212;1 } , V2 = {v2 , v4 , v6 , ..., vn&#x2212;2 } and V3 = {vn }. In the sameargument with the proof of Theorem 3.11, every pair of vertices (u j , uk ) with k = j + 1 &#x2DC;are weakly adjacent in G. This means that every pair of vertices in V i are weakly adjacent.So that, we can construct the family &#x393; = {&#x3B3; 1 , &#x3B3;2 , &#x3B3;3 } where &#x3C3;(v), if v &#x2208; Vk &#x3B3;k (v) = 0, if v &#x2208; Vk for all k = 1, 2, 3.The family &#x393; satisfy all of the conditions in De&#xFB01;nition 2.6. This is the minimal fuzzycoloring since any family with less than 3 members does not satisfy all of the conditions &#x2DC;in De&#xFB01;nition 2.6. Thus &#x3C7;F (G) = 3. Next, we give a theorem on an upper bound for the fuzzy chromatic number of fuzzycycles and their complement &#x2DC;Theorem 3.13. If G(V, &#x3C3;, &#xB5;) is a fuzzy cycle with n vertices ( n &#x2265; 4 ), then &#x3C7;F + &#x3C7;F &#x2264; 2(n &#x2212; 1) and &#x3C7;F &#xB7; &#x3C7;F &#x2264; n(n &#x2212; 2) &#xAF; &#xAF; &#x2DC; &#xAF; &#x2DC;Proof. Let G(V, &#x3C3;, &#xB5;) be a fuzzy cycle with n vertices and G = (&#xAF; , &#xB5;) be a complement &#x3C3; &#xAF; &#x2DC; Let V = {v1 , v2 , ..., vn }. We consider two cases.of G.Case 1: &#xB5;(ui , ui+1 ) = 1 min{&#x3C3;(ui ), &#x3C3;(ui+1 )} for all i = 1, 2, . . . , n &#x2212; 1 . 2
• 7. I.Rosyida, S.Lavanya, Widodo, Ch.R.Indrati, K.A.Sugeng 7Then &#xB5;(ui , ui+1 ) = 1 min{&#x3C3;(ui ), &#x3C3;(ui+1 )} for all i = 1, 2, . . . , n &#x2212; 1 . In other words, the &#xAF; 2 &#xAF; &#x2DC;pair of vertices (ui , ui+1 ) are strongly adjacent in G. In the same argument with theproof of Theorem 3.11, every pair of vertices (u j , uk ) with k = j + 1 are weakly adjacent &#x2DC; &#xAF; &#x2DC;in G. Then this vertices are strongly adjacent in G . Thus, every pair of vertices arestrongly adjacent in G &#xAF; . By lemma 3.9, &#x3C7; = n . &#x2DC; &#xAF; FBy the Theorem 3.11, if n is even and n &#x2265; 4 then &#x3C7;F + &#x3C7;F = 2 + n &#x2264; (n &#x2212; 2) + n = 2(n &#x2212; 1) &#xAF; and &#x3C7;F &#xB7; &#x3C7;F = 2n &#x2264; (n &#x2212; 2)n &#xAF;By the Theorem 3, if n is odd and n &#x2265; 5 then &#x3C7;F + &#x3C7;F &#x2264; 3 + n &#x2264; (n &#x2212; 2) + n = 2(n &#x2212; 1) &#xAF; and &#x3C7;F &#xB7; &#x3C7;F = 3n &#x2264; (n &#x2212; 2)n &#xAF; &#x2DC;Case 2: G has at least a pair of vertices (uk , uk+1 ) such that &#xB5;(uk , uk+1 ) =12 min{&#x3C3;(uk ), &#x3C3;(uk+1 )}This means that there is at least a pair of vertices u k and uk+1 which are weakly adjacent &#xAF; &#x2DC; &#xAF; &#x2DC;in G. So that we can construct the family &#x393; = {&#x3B3; 1 , &#x3B3;2 , ..., &#x3B3;k } for k &#x2264; n &#x2212; 1 on G where &#x3B3;i (u) = &#x3C3;(u), and &#x3B3;i (v) = &#x3C3;(v) &#xAF; &#x2DC; if u and v are weakly adjacent in G &#xAF; &#x2DC; &#x3B3;k (u) = &#x3C3;(u), &#x3B3;k (v) = 0, k = i, if u and v are strongly adjacent in GThe family &#x393; satisfy all of the conditions in De&#xFB01;nition 2.6. Thus &#x3C7; F &#x2264; n &#x2212; 1 . &#xAF;By theorem 3.11 and 3.12, &#x3C7;F + &#x3C7;F &#x2264; 3 + (n &#x2212; 1) &#xAF; and &#x3C7;F &#xB7; &#x3C7;F &#x2264; 3(n &#x2212; 1) . &#xAF;If n is even and n &#x2265; 4 then &#x3C7;F + &#x3C7;F &#x2264; 3 + (n &#x2212; 1) &#x2264; (n &#x2212; 1) + (n &#x2212; 1) = 2(n &#x2212; 1) &#xAF; and&#x3C7;F &#xB7; &#x3C7;F &#x2264; 3(n &#x2212; 1) &#x2264; (n &#x2212; 1)(n &#x2212; 1) &#x2264; n(n &#x2212; 2) . &#xAF;If n is odd and n &#x2265; 4 then &#x3C7;F + &#x3C7;F &#x2264; 3 + (n &#x2212; 1) &#x2264; (n &#x2212; 2) + (n &#x2212; 1) &#x2264; 2(n &#x2212; 1) &#xAF; and&#x3C7;F &#xB7; &#x3C7;F &#x2264; 3(n &#x2212; 1) &#x2264; (n &#x2212; 2)(n &#x2212; 1) &#x2264; n(n &#x2212; 2) . &#xAF;3.2. Fuzzy Chromatic Number of a Fuzzy Graph and Its Complement In crisp graph case, an upper bound for the chromatic number of a graph and itscomplement has been given by Nordhaus and Gaddum as in [8]. In case of fuzzy graph,an upper bound has been given by Sattanathan and Lavanya [8].Theorem 3.14. (Nordhaus and Gaddum) If G(V, E) is a graph with n vertices then &#x221A; &#xAF; 2 n &#x2264; &#x3C7;(G) + &#x3C7;(G) &#x2264; n + 1 &#xAF; n+1 2 n &#x2264; &#x3C7;(G) &#xB7; &#x3C7;(G) &#x2264; ( ) 2
• 8. 8 An Upper of fuzzy chromatic number of Fuzzy graphs and their Complement &#x2DC; &#xAF; &#x2DC;Theorem 3.15. (Sattanathan and Lavanya) If G(V &#x3C3;, &#xB5;) is a fuzzy graph and G = (&#xAF; , &#xB5;) &#x3C3; &#xAF; &#x2DC; , thenis a complement of G &#x2DC; &#xAF; &#xAF; &#x2DC; &#x3C7;F (G) + &#x3C7;F (G) &#x2264; 2(n &#x2212; 1) &#x2DC; &#xAF; &#xAF; &#x2DC; &#x3C7;F (G) &#xB7; &#x3C7;F (G) &#x2264; n2 + 1 In example 3.16 and 3.17 we give two fuzzy graphs which do not satisfy Theorem 3.14and 3.15. &#x2DC;Example 3.16. Let G(V, &#x3C3;, &#xB5;) be a fuzzy graph which is self complementary. It meansthat &#xB5;(u, v) = &#xB5;(u, v) = 1 min{&#x3C3;(u), &#x3C3;(v)} for all u, v &#x2208; V . &#xAF; 2 A 0.2 0.1 0.1 0.1 B 0.4 D 0.3 0.15 0.2 0.15 C 0.5 &#x2DC; &#xAF; &#x2DC; Figure 1: A fuzzy graph G = GLet &#x393; = {&#x3B3;1 , &#x3B3;2 , &#x3B3;3 , &#x3B3;4 } be a family of sets de&#xFB01;ned on V as in Table 1. &#x2DC; Table 1: The Family &#x393; = {&#x3B3;1 , &#x3B3;2 , &#x3B3;3 , &#x3B3;4 } of fuzzy sets on V of Fuzzy Graph G Vertices &#x3B3;1 &#x3B3;2 &#x3B3;3 &#x3B3;4 Max A 0.2 0 0 0 0.2 B 0 0.4 0 0 0.4 C 0 0 0.5 0 0.5 D 0 0 0 0.3 0.3Here we can see that the family &#x393; satisfy all of the conditions in De&#xFB01;nition 2.6. Thisis the minimal fuzzy coloring since any family with less than 4 members does not satisfy &#x2DC; &#x2DC;the conditions in De&#xFB01;nition 2.6. Thus &#x3C7; F (G) = 4 . Since G is self complementary then&#xAF; &#x2DC; &#xAF; = 4. The sum of the fuzzy chromatic number of G and the fuzzy chromatic number&#x3C7;F (G) &#x2DC;of G&#xAF; as follows: &#x3C7; (G) + &#x3C7; (G) = 8 &gt; 6 = 2(n &#x2212; 1). &#x2DC; &#x2DC; &#xAF;F &#x2DC; &#xAF; F &#x2DC;Thus G does not satisfy Theorem 3.15.
• 9. I.Rosyida, S.Lavanya, Widodo, Ch.R.Indrati, K.A.Sugeng 9 We also have other example of fuzzy graph which it does not satisfy Theorem 3.15. Thefuzzy graph can be seen in the following example. &#x2DC;Example 3.17. Let G(V, &#x3C3;, &#xB5;) is a fuzzy graph as in the &#xFB01;gure below. A 0.3 A 0.3 0.15 0.15 0.15 0.15 0.15 0.15 B 0.4 D 0.6 B 0.4 D 0.6 0.2 0.2 0.2 0.2 0.2 0.3 C 0.5 C 0.5 &#x2DC; &#xAF; &#x2DC; Figure 2: A fuzzy graph G and its complement G &#x2DC;We can see that CD is weakly adjacent in G . while vertex A is strongly adjacent toB and D . Then the family satisfying all of the conditions in de&#xFB01;nition of fuzzy vertex &#x2DC;coloring of G is given by Table 2. &#x2DC; Table 2: The Family &#x393; = {&#x3B3;1 , &#x3B3;2 , &#x3B3;3 } of Fuzzy Graph G in the &#xFB01;gure 2 Vertices &#x3B3;1 &#x3B3;2 &#x3B3;3 Max A 0.3 0 0 0.3 B 0 0.4 0 0.4 C 0 0 0.5 0.5 D 0 0 0.6 0.6 &#x2DC;On the other hand, all of the vertices in G are strongly adjacent. Thus we can construct &#xAF; &#x2DC;the family &#x393; of fuzzy sets on V of G as in Table 3. &#xAF; &#x2DC; Table 3: The Family &#x393; = {&#x3B3;1 , &#x3B3;2 , &#x3B3;3 , &#x3B3;4 } of the complement G Vertices &#x3B3;1 &#x3B3;2 &#x3B3;3 &#x3B3;4 Max A 0.3 0 0 0 0.3 B 0 0.4 0 0 0.4 C 0 0 0.5 0 0.5 D 0 0 0 0.6 0.6 &#x2DC; &#x2DC;We can see that the chromatic number of G is &#x3C7;F (G) = 3 and the chromatic number &#xAF; &#xAF; &#x2DC; &#x2DC; &#xAF; &#xAF; &#x2DC;of its complement is &#x3C7;F (G) = 4 . Thus, &#x3C7;F (G) + &#x3C7;F (G) = 7 &gt; 6 = 2(n &#x2212; 1) . Thus, itsupper bound does not satisfy the Theorem 3.15. In the theorem 3.18 and 3.19, we add conditions for the theorem of Sattanathan andLavanya which is explained below.
• 10. 10 An Upper of fuzzy chromatic number of Fuzzy graphs and their Complement &#x2DC; &#xAF; &#x2DC;Theorem 3.18. Let G(V &#x3C3;, &#xB5;) be a fuzzy graph with n vertices and G = (&#xAF; , &#xB5;) be a &#x3C3; &#xAF; &#x2DC; . If G satis&#xFB01;es the following properties:complement of G &#x2DC; i. there is exactly one pair of vertices u, v &#x2208; V such that &#xB5;(u, v) = 1 min{&#x3C3;(u), &#x3C3;(v)} 2 ii. &#xB5;(x, y) = 1 min{&#x3C3;(x), &#x3C3;(y)} for all x, y &#x2208; V &#x2212; {u, v} 2 &#x2DC; &#xAF; &#xAF; &#x2DC; then &#x3C7;F (G) + &#x3C7;F (G) = 2n &#x2212; 1 and &#x2DC; &#xAF; &#xAF; &#x2DC; &#x3C7;F (G) &#xB7; &#x3C7;F (G) = n(n &#x2212; 1) &#x2DC; &#xAF; &#x2DC;Proof. Let G(V &#x3C3;, &#xB5;) be a fuzzy graph with n vertices and G = (&#xAF; , &#xB5;) be a complement &#x3C3; &#xAF; &#x2DC; . Let V = {v1 , v2 , v3 , ..., vn }. Since G satis&#xFB01;es the following properties:of G &#x2DC; i. there is exactly one pair of vertices u, v &#x2208; V such that &#xB5;(u, v) = 1 min{&#x3C3;(u), &#x3C3;(v)} 2 ii. &#xB5;(x, y) = 1 min{&#x3C3;(x), &#x3C3;(y)} for all x, y &#x2208; V &#x2212; {u, v} 2 &#x2DC;then G has exactly one pair of vertices u, v &#x2208; V such that &#xB5;(u, v) &gt; 1 min{&#x3C3;(u), &#x3C3;(v)} 2or &#xB5;(u, v) &lt; 1 min{&#x3C3;(u), &#x3C3;(v)} . 2Without loss of generality, we assume v 1 and v2 are the vertices which satisfy &#xB5;(v1 , v2 ) &lt;12 min{&#x3C3;(v1 ), &#x3C3;(v2 )} Then we can construct a fuzzy subset &#x3B3; 1 of V where &#x3B3;1 (v1 ) = &#x3C3;(v1 ) , &#x3B3;1 (v2 ) = &#x3C3;(v2 ) ,and &#x3B3;1 (vi ) = 0 for each vi &#x2208; V &#x2212; {v1 , v2 } .On the other hand, other pair of vertices v i , vj &#x2208; V &#x2212; {v1 , v2 } are strongly adjacent in G .&#x2DC;Then we can construct fuzzy subsets &#x3B3; k (k = 1, k = 2, 3, ..., n &#x2212; 1) where &#x3B3;k (v) = &#x3C3;(v) ifv = vk+1 and &#x3B3;k (v) = 0. if v = vk+1So we have the family &#x393; = {&#x3B3;1 , &#x3B3;2 , . . . , &#x3B3;n&#x2212;1 } which satisfy the properies a,b,c in De&#xFB01;nition &#x2DC;2.6. Thus &#x3C7;F (G) = n &#x2212; 1 . &#x2DC;By theorem 2.7, since v1 and v2 are weakly adjacent in G then this vertices are stronglyadjacent in G &#xAF; . On the other hand, for each v , v &#x2208; V &#x2212;{v , v } are also strongly adjacent &#x2DC; i j 1 2in G&#xAF; &#x2DC; (By Theorem 2.5). So that every pair of vertices are strongly adjacent in G . By &#xAF; &#x2DC; &#xAF; &#xAF; &#x2DC;Lemma 3.9, &#x3C7;F (G) = n . &#x2DC; &#xAF; &#xAF; &#x2DC;Thus &#x3C7;F (G) + &#x3C7;F (G) = n + (n &#x2212; 1) = 2n &#x2212; 1 and &#x2DC; &#xAF; &#xAF; &#x2DC; &#x3C7;F (G) &#xB7; &#x3C7;F (G) = n &#xB7; (n &#x2212; 1) .In the same way, if there is exactly one pair of vertices u, v &#x2208; V such that &#xB5;(u, v) &gt;1 &#x2DC;2 min{&#x3C3;(u), &#x3C3;(v)} then we have &#x3C7; F (G) = n and &#xAF; &#xAF; &#x2DC; &#x3C7;F (G) = n &#x2212; 1Theorem 3.19. Let &#x2DC; &#xAF; &#x2DC; G(V &#x3C3;, &#xB5;) be a fuzzy graph with n vertices and G = (&#xAF; , &#xB5;) be a &#x3C3; &#xAF; &#x2DC;complement of G . If &#x2DC; is not self complementary and G does not satisfy the properties G &#x2DC;in Theorem 3.18 then &#x2DC; &#xAF; &#xAF; &#x2DC; &#x3C7;F (G) + &#x3C7;F (G) &#x2264; 2(n &#x2212; 1) and &#x2DC; &#xAF; &#xAF; &#x2DC; &#x3C7;F (G) &#xB7; &#x3C7;F (G) &#x2264; (n &#x2212; 1)2
• 11. I.Rosyida, S.Lavanya, Widodo, Ch.R.Indrati, K.A.Sugeng 11 &#x2DC; &#xAF; &#x2DC;Proof. Let G(V, &#x3C3;, &#xB5;) be a fuzzy graph with n vertices and G = (&#xAF; , &#xB5;) be a complement &#x3C3; &#xAF;of G&#x2DC; . Since G is not self complementary and G does not satisfy the properties in &#x2DC; &#x2DC; &#x2DC;Theorem 3.18, then G has at least a pair of vertices which are weakly adjacent and G &#x2DC; 1also has at least a pair of vertices u, v &#x2208; V such that &#xB5;(u, v) &gt; 2 min{&#x3C3;(u), &#x3C3;(v)} . Since&#x2DC;G has at least a pair of vertices which are weakly adjacent then by the proof of case 2 &#x2DC; &#x2DC;of theorem 3.13 &#x3C7;F (G) &#x2264; n &#x2212; 1 . On the other hand, since G has at least a pair ofvertices which are strongly adjacent then there is at least a pair of vertices which are &#xAF; &#x2DC; &#xAF; &#xAF; &#x2DC; &#x2DC; &#xAF; &#xAF; &#x2DC;weakly adjacent in G . So &#x3C7;F (G) &#x2264; n &#x2212; 1 . Thus &#x3C7;F (G) + &#x3C7;F (G) &#x2264; 2(n &#x2212; 1) and&#x3C7; (G) &#xAF; &#xAF; &#x2DC; &#xB7; &#x3C7; (G) &#x2264; (n &#x2212; 1)2 . &#x2DC; F F 4. Conclusion In this paper, we give fuzzy chromatic number of a fuzzy cycle in Theorem 3.11 and3.12. We also give an upper bound for fuzzy chromatic number of a fuzzy cycle and itscomplement in Theorm 3.13. We also add conditions to a fuzzy graph so it satis&#xFB01;es thetheorem of Sattanathan and Lavanya as in Theorem 3.19. Further we are trying to &#xFB01;ndfuzzy chromatic number of other classes of fuzzy graphs, and fuzzy chromatic number ofoperations on fuzzy graphs. References [1] N. Biggs, Algebraic Graph Theory, Great Britain, 1974. [2] C.Eslahchi, B.N.Onagh, Vertex Strength of Fuzzy Graphs, International Journal of Mathematics and mathematical Sciences., 436 (2006) 1-9. [3] G.J. Klir, B.Yuan, Fuzzy sets and Fuzzy Logic-Theory and Applications, United State of America, 1995. [4] S.Lavanya, R.Sattanathan, Fuzzy vertex Coloring of Fuzzy Graphs, International review of Fuzzy Mathematics., Juli-December (2011) issue. [5] J,N Mordeson, P.S. Nair, Fuzzy Graphs and Fuzzy Hypergraphs, New York, 2000. [6] S.Munoz, M.T.ortuno, R.Javier and J.Yanez, Colouring Fuzzy Graphs, Omega:The Journal of Management Sciences., 33 (2005) 211-221. [7] MM.Pourpasha and M.R.Soheilifar, Fuzzy Chromatic Number and Fuzzy De&#xFB01;ning Number of Certain Fuzzy Graphs-Proceedings of 12th WSEAS International Confer- ence on Applied Mathematics, Cairo, 2007.
• 12. 12 An Upper of fuzzy chromatic number of Fuzzy graphs and their Complement [8] R.Sattanathan, S.Lavanya, Complementary Fuzzy Graphs and Fuzzy Chromatic Number, International Journal of Algorithms, Computing and Mathematics., 3 (2009) 21-25. [9] M.S.Sunitha, A.V.Kumar, Complement of Fuzzy Graph, Indian J. Pure Appl.Math., 33 (2002) 1451-1464.[10] L.A.Zadeh, Fuzzy Sets, Information and Control., 8 (1965) 338-353.