/ / Article

Research Article | Open Access

Volume 2019 |Article ID 5213020 | https://doi.org/10.1155/2019/5213020

Mamo Abebe Ashebo, V. N. Srinivasa Rao Repalle, "Fuzzy Chromatic Polynomial of Fuzzy Graphs with Crisp and Fuzzy Vertices Using α-Cuts", Advances in Fuzzy Systems, vol. 2019, Article ID 5213020, 11 pages, 2019. https://doi.org/10.1155/2019/5213020

# Fuzzy Chromatic Polynomial of Fuzzy Graphs with Crisp and Fuzzy Vertices Using α-Cuts

Revised28 Mar 2019
Accepted02 Apr 2019
Published02 May 2019

#### Abstract

Coloring of fuzzy graphs has many real life applications in combinatorial optimization problems like traffic light system, exam scheduling, register allocation, etc. In this paper, the concept of fuzzy chromatic polynomial of fuzzy graph is introduced and defined based on -cuts of fuzzy graph. Two different types of fuzziness to fuzzy graph are considered in the paper. The first type was fuzzy graph with crisp vertex set and fuzzy edge set and the second type was fuzzy graph with fuzzy vertex set and fuzzy edge set. Depending on this, the fuzzy chromatic polynomials for some fuzzy graphs are discussed. Some interesting remarks on fuzzy chromatic polynomial of fuzzy graphs have been derived. Further, some results related to the concept are proved. Lastly, fuzzy chromatic polynomials for complete fuzzy graphs and fuzzy cycles are studied and some results are obtained.

#### 1. Introduction

Nowadays, many real world problems cannot be properly modeled by a crisp graph theory, since the problems contain uncertain information. The fuzzy set theory, anticipated by Zadeh [1], is used to handle the phenomena of uncertainty in real life situation. A lot of works have been done in fuzzy shortest path problems using type 1 fuzzy set in [25]. Dey et al. [6] introduced interval type 2 fuzzy set in the fuzzy shortest path problems. Recently, in [7], the authors proposed a genetic algorithm for solving fuzzy shortest path problem with interval type 2 fuzzy arc lengths. Some researchers also used the fuzzy set theory to touch the uncertainty in crisp graphs. Kaufmann [8] proposed the first definition of fuzzy graph in 1973, based on Zadeh’s fuzzy relations. Later, Rosenfeld [9] introduced another elaborated definition of fuzzy graph with fuzzy vertex set and fuzzy edge set in 1975. He developed the theory of fuzzy graph. After that, Bhattacharya [10] has established some connectivity concepts regarding fuzzy cut nodes and fuzzy bridges. Bhutani [11] has studied automorphisms on fuzzy graphs and certain properties of complete fuzzy graphs. Also, Mordeson and Nair [12] introduced cycles and cocycles of fuzzy graphs. Several authors including Sunitha and Vijayakumar [13, 14], Bhutani and Rosenfeld [15], Mathew and Sunitha [16], Akram [17], and Akram and Dudek [18] have introduced numerous concepts in fuzzy graphs. Fuzzy graph theory has several applications in various fields like clustering analysis, database theory, network analysis, information theory, etc. [19].

Coloring of fuzzy graphs plays a vital role in theory and practical applications. It is mainly studied in combinatorial optimization problems like traffic light control, exam scheduling, register allocation, etc. [20]. Fuzzy coloring of a fuzzy graph was defined by authors Eslahchi and Onagh in 2004 and later developed by them as fuzzy vertex coloring [21] in 2006. Another approach of coloring of fuzzy graphs was introduced by Munoz et al. [22]. The authors have defined the chromatic number of a fuzzy graph. Incorporating the above two approaches of coloring of fuzzy graph, Kishore and Sunitha [23] introduced chromatic number of fuzzy graphs and developed algorithm. Dey and Pal [24] introduced the vertex coloring of a fuzzy graph using -cuts. In [25], they have used the vertex coloring of fuzzy graph to classify the accidental zone of a traffic control. Further, in [26], the authors proposed genetic algorithm to find the robust solutions for fuzzy robust coloring problem. The authors, Ananthanarayanan and Lavanya [20], introduced fuzzy chromatic number and fuzzy total chromatic number of a fuzzy graph using -cuts. Rosyida et al. [27] proposed a new approach to determine fuzzy chromatic number of fuzzy graph through its -chromatic number. Samanta et al. [28] also introduced a new concept for coloring of fuzzy graphs using fuzzy color. Lately, Dey et al. [29] introduced the concept of vertex and edge coloring of vague graphs which are the generalized structure of fuzzy graphs.

In the literature, to the best of our knowledge, there is no study on the fuzzy chromatic polynomial of fuzzy graphs. Therefore, in this paper, we consider the chromatic polynomial in fuzzy graph, called fuzzy chromatic polynomial of fuzzy graph. Based on this, we define the concept of fuzzy chromatic polynomial of a fuzzy graph using -cuts of fuzzy graph. Also, we determine the fuzzy chromatic polynomial for fuzzy graphs with crisp and fuzzy vertex set. To determine the fuzzy chromatic polynomial, the classical method for computing the chromatic polynomial of crisp graph is used. Next, we derive some interesting remarks on fuzzy chromatic polynomial of fuzzy graph with crisp and fuzzy vertices. Further, we prove more elegant results on fuzzy chromatic polynomial of fuzzy graphs. Finally, we study a fuzzy chromatic polynomial for complete fuzzy graphs and fuzzy cycles.

The rest of paper is organized as follows. In Section 2, some basic definitions and elementary concepts of fuzzy set, fuzzy graph, and coloring of fuzzy graphs are reviewed. In Section 3, fuzzy chromatic polynomial of a fuzzy graph using -cut of fuzzy graph is defined. Also, fuzzy chromatic polynomials for fuzzy graphs with crisp and fuzzy vertices are determined. In Section 4, more results on fuzzy chromatic polynomials are proved. Furthermore, fuzzy chromatic polynomial for complete fuzzy graphs and fuzzy cycles are studied. Finally, the paper is concluded in Section 5.

#### 2. Preliminaries

In this section, some basic aspects that are necessary for this paper are included. These preliminaries are given in three subsections.

##### 2.1. Basic Definitions and Concepts on Vertex Coloring and Chromatic Polynomial

In this subsection some basic definitions and concepts of vertex coloring and chromatic polynomials are reviewed [30, 31].

Definition 1. Let be a graph. A vertex-coloring of is an assignment of a color to each of the vertices of in such a way that adjacent vertices are assigned different colors. If the colors are chosen from a set of colors, then the vertex-coloring is called a -vertex-coloring, abbreviated to -coloring, whether or not all colors are used.

Definition 2. If has a -coloring, then is said to be -colorable.

Definition 3. The smallest , such that is -colorable, is called the chromatic number of , denoted by

Definition 4. Let be a simple graph. The chromatic polynomial of is the number of ways we can achieve a proper coloring on the vertices of with the given colors and it is denoted by . It is a monic polynomial in with integer coefficients, whose degree is the number of vertices of .

If we are given an arbitrary simple graph, it is usually difficult to obtain its chromatic polynomial by examining the structure of a graph (by inspection). The following theorem gives us a systematic method for obtaining the chromatic polynomial of a simple graph in terms of the chromatic polynomial of null graphs.

Theorem 5. Let be a simple graph, and let and be the graphs obtained from by deleting and contracting an edge . Then

##### 2.2. Basic Definitions on Fuzzy Set and Fuzzy Graphs

In this subsection, some basic definitions on fuzzy set and fuzzy graphs are reviewed [1, 9, 19, 32].

Definition 6. A fuzzy set defined on a nonempty set is the family, where is the membership function. In classical fuzzy set theory the set I is usually defined as the interval such thatIt takes any intermediate value between 0 and 1 represents the degree in which . The set could be discrete set of the form where indicates that the degree of membership of x to A is lower than the degree of membership of .

Definition 7. -cut set of fuzzy set is defined as is made up of members whose membership is not less than , . -cut set of fuzzy set is crisp set.

Definition 8. A fuzzy graph is an algebraic structure of nonempty set together with a pair of functions and such that for all , and is a symmetric fuzzy relation on . Here and represent the membership values of the vertex and of the edge in , respectively.

In this paper, we denote and . Here, we considered fuzzy graph is simple (with no loops and parallel edges), finite, and undirected. is reflective (that is, , for all ) and symmetric (that is, , for all

Note that a fuzzy graph is a generalization of crisp graph in which for all and if and if . So, all the crisp graphs are fuzzy graphs but all fuzzy graphs are not crisp graphs.

Definition 9. The fuzzy graph is called a fuzzy subgraph of G if for each two elements u, we have and

Definition 10. The fuzzy graph is called connected if, for every two elements u, there exists a sequence of elements such that , , and , .

Definition 11. For any fuzzy graph , let with elements. Now assume such that . The sequence and the set are called the fundamental sequence and the fundamental set (or level set) of , respectively.

Definition 12. The underlying crisp graph of a fuzzy graph is such that and

Definition 13. For , -cut graph of a fuzzy graph is a crisp graph such that and . It is obvious that a fuzzy graph will have a finite number of different α-cuts.

##### 2.3. Basic Definitions in Fuzzy Coloring of Fuzzy Graphs

The concept of chromatic number of fuzzy graph was introduced by Munoz et al. [22]. The authors considered fuzzy graphs with crisp vertex set, that is, fuzzy graphs, for which for all and edges with membership degree in

Definition 14 (see [22]). If is such a fuzzy graph where and is a fuzzy number on the set of all subsets of , assume , where is the fundamental set (level set) of . For each , denote the crisp graph , where and denote the chromatic number of crisp graph .

By this definition the chromatic number of fuzzy graphs G is the fuzzy number , where and

Later Eslahchi and Onagh [21] introduced fuzzy vertex coloring of fuzzy graph. They defined fuzzy chromatic number as the least value of for which the fuzzy graph has -fuzzy coloring as follows.

Definition 15 (see [21]). A family of fuzzy sets on a set is called a -fuzzy coloring of if(i),(ii),(iii)for every strong edge (i.e., ) of , (

Definition 16 (see [21]). The minimum number for which there exists a -fuzzy coloring is called the fuzzy chromatic number of , denoted as

Incorporating the features of the above two definitions, Kishore and Sunitha [23] modified the chromatic number of fuzzy graph as follows.

Definition 17 (see [23]). For each , denote the crisp graph and denote the chromatic number of crisp graph The chromatic number of fuzzy graph is the number .

#### 3. Fuzzy Chromatic Polynomial of a Fuzzy Graph

A fuzzy chromatic polynomial is a polynomial which is associated with the fuzzy coloring of fuzzy graphs. Therefore, chromatic polynomial in fuzzy graph is called fuzzy chromatic polynomial of fuzzy graph. In this section, we define the concept of fuzzy chromatic polynomial of a fuzzy graph based on -cuts of fuzzy graph which are crisp graphs. Furthermore, we determine the fuzzy chromatic polynomials for some fuzzy graphs with crisp and fuzzy vertices.

Crisp vertex coloring and the chromatic polynomial of -cut graph of the fuzzy graph are defined as follows.

Definition 18. Let be a fuzzy graph and denote -cut graph of the fuzzy graph which is a crisp graph , A function , is called a -coloring (crisp vertex coloring) of if whenever the vertices and are adjacent in

Definition 19. The number of distinct k-coloring on the vertices of is called the chromatic polynomial of . It is denoted by .

Let be the family of -cuts sets of , where the -cut of a fuzzy graph is the crisp graph Hence, any crisp k-coloring can be defined on the vertex set of . The k-coloring function of the fuzzy graph is defined through this sequence. For each , let the fuzzy chromatic polynomial of be defined through a monotone family of sets.

Fuzzy chromatic polynomial of a fuzzy graph is defined as follows.

Definition 20. Let be a fuzzy graph. The fuzzy chromatic polynomial of is defined as the chromatic polynomial of its crisp graphs , for . It is denoted by .

That is, , .

##### 3.1. Fuzzy Chromatic Polynomial of Fuzzy Graph with Crisp Vertices

In this subsection, we present fuzzy chromatic polynomial of fuzzy graphs with crisp vertices and fuzzy edges.

A fuzzy graph with crisp vertices and fuzzy edges, and -cut graph of are defined as follows.

Definition 21. A fuzzy graph is defined as a pair such that(1)V is the crisp set of vertices (that is, ;(2)the function is defined by , for all

Definition 22. Let be a fuzzy graph. For , -cut graph of the fuzzy graph is defined as the crisp graph , where .

Example 23. Consider the fuzzy graph with crisp vertices and fuzzy edges in Figure 1.

In , we consider ; for each , we have a crisp graph and its chromatic polynomial which is the fuzzy chromatic polynomial of the fuzzy graph is obtained (see Figure 2). (The integers in the brackets denote the number of ways of coloring the vertices.)

Remark 24. The fuzzy chromatic polynomial depends on the values of , which means the fuzzy chromatic polynomial varies for the same fuzzy graph for different values of .

For the fuzzy graph in Example 23, the fuzzy chromatic polynomial varies for different values of as shown below:

Remark 25. The fuzzy chromatic polynomial of a fuzzy graph does not need to be decreased when the value of increases. Let us consider , , , , and for the fuzzy graph in Example 23, but , , where is the chromatic number of the crisp graph i=1,2,3,4,5 is not decreased as increases. For instance, , , , , and .

Remark 26. Let be a fuzzy graph with n vertices. Then for with crisp vertices and fuzzy edges and for , is not always , where is the null crisp graph with n vertices which is clear from the following example.

Example 27. Consider the fuzzy graph given in Figure 3(a). In Figure 3(a), for , is a crisp graph in Figure 3(b). But is not a null crisp graph with three vertices. Thus,

The following result gives the degree of fuzzy chromatic polynomial of fuzzy graph with crisp vertices and fuzzy edges are equal to the number of vertices in crisp vertex set.

Lemma 28. Let be a fuzzy graph with crisp vertices and fuzzy edges. Then the degree of , for all

Proof. Let be a fuzzy graph with crisp vertices and fuzzy edges. Now, , where . We know that the degree of the chromatic polynomial of a crisp graph is the number of vertices of That is, the degree of . By Definition 20, we have , for . From this it follows that the degree of is equal to the degree of Therefore,

##### 3.2. Fuzzy Chromatic Polynomial of Fuzzy Graph with Fuzzy Vertices

In Section 3.1, we introduced the fuzzy chromatic polynomial of fuzzy graph , where is crisp set vertices and is fuzzy set of edges. In this subsection, we present fuzzy chromatic polynomial of fuzzy graphs with fuzzy vertex set and fuzzy edge set. Here, we use Definition 8 for fuzzy graph and Definition 13 for -cut graph which are presented in Section 2.

Example 29. Consider a fuzzy graph with fuzzy vertex set and fuzzy edge set in Figure 4

In , we consider ; for each , we have a crisp graph and its chromatic polynomial which is the fuzzy chromatic polynomial of the fuzzy graph is obtained (see Figure 5). (The integers in the brackets denote the number of ways of coloring the vertices.)

Remark 30. The fuzzy chromatic polynomial varies for the same fuzzy graph for different values of . It is clear from Example 29. Here, the fuzzy chromatic polynomial of the fuzzy graph in Example 29 is given below.

Remark 31. For fuzzy graph with fuzzy vertex set and fuzzy edge set, the degree of the fuzzy chromatic polynomial of is not always equal to the number of vertices of . It can be easily seen from the fuzzy chromatic polynomial of the fuzzy graph in Example 29.
For instance, for , the degree of which is the number of vertices of , but for , the degree of ; also for , the degree of .

Remark 32. The fuzzy chromatic polynomial of fuzzy graph with fuzzy vertex set and fuzzy edge set, will be decreased when the value of α will increase, since in fuzzy graph with fuzzy vertices and fuzzy edges, both and decrease as α increases (see Table 1).

 0 3 3 3 k(k-1)(k-2) 6 24 60 120 0.1 3 3 3 k(k-1)(k-2) 6 24 60 120 0.5 3 2 2 k(k-1)2 2 12 36 80 0.7 2 1 2 k(k-1) 2 6 12 20 0.8 2 0 1 k2 1 4 9 16 1 1 0 1 k 1 2 3 4

Example 33. Consider a fuzzy graph with fuzzy vertex set and fuzzy edge set in Figure 6.

By routine computation, the fuzzy chromatic polynomial of the fuzzy graph in Figure 6 is obtained as

Table 1 shows that the fuzzy chromatic polynomial of the fuzzy graph in Example 33 deceases as increases (see column 1 and columns 6-9 of Table 1). Moreover, both the number of vertices and the number of edges of -cut graph of the fuzzy graph decrease as increases (see column 1 and columns 2 and 3 of Table 1).

#### 4. Main Results

In this section, we prove some relevant results on fuzzy chromatic polynomial for fuzzy graphs which are discussed in Section 3. Moreover, the fuzzy chromatic polynomial of complete fuzzy graph and the fuzzy chromatic polynomial of fuzzy graphs which are cycles and fuzzy cycles are studied.

##### 4.1. α-Cut Graph and Fuzzy Graph

The relations among different -cuts of a fuzzy graph have been established as follows.

Lemma 34. Let be a fuzzy graph. If , then the following are true.(i)(ii)

Proof. Let be a fuzzy graph and . Now, , where and . Also, , where and . Since , we have and From this, results (i) and (ii) hold.

Theorem 35. Let be a fuzzy graph. If , then is a subgraph of

Proof. Let be a fuzzy graph and . Now, , where and . Also, , where and . From Lemma 34, we get and . That means, for any element , and for any element , Hence, is a subgraph of

Theorem 36. Let be a fuzzy graph. If , then deg deg .

Proof. Let be a fuzzy graph and . Now, , where and . Also, , where and . We know that the degree of the chromatic polynomial of a crisp graph is the number of vertices in the crisp graph. Therefore, the degree of and the degree of . By Lemma 34(i), we have . Therefore, deg deg

The relations between the -cut graph of a fuzzy graph and the value of , the fuzzy chromatic polynomial of a fuzzy graph, and the chromatic polynomial of corresponding complete crisp graph can be determined below.

Lemma 37. Let be a fuzzy graph with n vertices and be -cut of G. Then if , then is a complete crisp graph with n vertices.

Proof. Let be a fuzzy graph with n vertices and Now, , where and . Here, consists of all the vertices in V of G. Similarly, consists of all the edges in E and all the edges not in E of G. This shows that all the vertices in of are adjacent to each other. Therefore, is a complete crisp graph of n vertices. This completes the proof.

Remark 38. For -cut of the fuzzy graph with n vertices, if

Theorem 39. Let be a fuzzy graph with n vertices and be -cut of G. Then if ,

Proof. Let be a fuzzy graph with n vertices and Now, , where and . Since is fuzzy graph. Then by Definition 20 and Remark 38, the result holds.

The relation between fuzzy chromatic polynomial of a fuzzy graph and the chromatic polynomial of corresponding underlying crisp graph is established below.

Theorem 40. Let be a fuzzy graph and be its underlying crisp graph. If , where L is the level set or fundamental set of , then .

Proof. Let be a fuzzy graph and let be the underlying crisp graph of , where and This means that and consists of all the edges in E. Let be a level set or fundamental set of . Put ; now , where and . Since is the minimum value in the level set L, consists of all the vertices of V and consists of all the edges in E. Therefore, Since is fuzzy graph, then, by Definition 20, we have

The following is an important theorem for computing the fuzzy chromatic polynomial of a fuzzy graph explicitly.

Theorem 41. Let be a fuzzy graph with n vertices and be its underlying crisp graph. If and , then where is a complete crisp graph with n vertices.

Proof. Let be a fuzzy graph with n vertices and let be the underlying crisp graph of , where and For , now , where and . Let us prove the theorem by considering three cases.
Case 1. Let Then by Theorem 39, the fuzzy chromatic polynomial of the fuzzy graph is the chromatic polynomial of a complete crisp graph with n vertices, . That is,Case 2. Let , where . Then by Theorem 40, the fuzzy chromatic polynomial of the fuzzy graph is the chromatic polynomial of its underlying crisp graph . That is, Case 3. Let ; since is in I, then by Definition 20 This completes the proof.

The following result shows that the degree of fuzzy chromatic polynomial of a fuzzy graph is less than or equal to the number of vertices of the fuzzy graph. It is a significant difference from crisp graph theory.

Theorem 42. Let be a fuzzy graph. Then the degree of

Proof. Let us prove the theorem by considering two cases.
Case 1. Let be a fuzzy graph with crisp vertices and fuzzy edges. By Lemma 28, the degree of Therefore, the result holds.
Case 2. Let be a fuzzy graph with fuzzy vertex set and fuzzy edge set. Now, , where and . We know that the degree of the chromatic polynomial of a crisp graph is the number of vertices of That is, the degree of . But for all , , since V. Then by Definition 20, we have , for Therefore, the degree of = the degree of This implies that Hence, from Case 1 and Case 2, we conclude that, for any fuzzy graph , the degree of ,

##### 4.2. Complete Fuzzy Graph and Fuzzy Cycle

In 1989, Bhutani [11] introduced the concept of a complete fuzzy graph as follows.

Definition 43 (see [11]). A complete fuzzy graph is a fuzzy graph such that for all

The following result gives the underlying crisp graph of a complete fuzzy graph is a complete crisp graph.

Lemma 44. Let be a complete fuzzy graph and be its underlying crisp graph. Then is a complete crisp graph.

It is clear from the following example.

Example 45. We show that the underlying crisp graph of a complete fuzzy graph is complete crisp graph. Let Define the fuzzy set on V as , and Define a fuzzy set on E such that , and . Then for all Thus, is a complete fuzzy graph. Now, where and . This shows that each vertex in joins each of the other vertices in exactly by one edge. Therefore, is a complete crisp graph

Remark 46. For complete fuzzy graph with n vertices, by Lemma 44, , where is a complete crisp graph.

The following is an important theorem for computing the fuzzy chromatic polynomial of a complete fuzzy graph explicitly.

Theorem 47. Let be a complete fuzzy graph with n vertices. If and then

Proof. Let be a complete fuzzy graph with n vertices and let be the underlying crisp graph of , where and For , where L is a level set of now where and . Let us prove the theorem by considering three cases.
Case 1. Let , and since is a fuzzy graph with n vertices then, by Theorem 39, we have
Case 2. Let , where ; since is a fuzzy graph then, by Theorem 40, we haveand since is complete fuzzy graph, then, by Remark 46 and (11), we get
Case 3. Let ; since is in I and is a fuzzy graph then by Theorem 41 This completes the proof.

Remark 48. For a complete fuzzy graph with crisp vertices (i.e., ) and , for all

The fuzzy chromatic polynomial of a complete fuzzy graph with can be defined in terms of the chromatic polynomial of complete crisp graph as follows.

Definition 49. Let be a complete fuzzy graph with vertices. Let be a level set of and . Define , , , …,

If , then the fuzzy chromatic polynomial of a complete fuzzy graph is defined as where , is a complete crisp graph with n vertices.

Note that the advantage of Definition 49 is that the fuzzy chromatic polynomial of a complete fuzzy graph with can be obtained without using the formal procedures. This situation can be illustrated in the following example.

Example 50. Consider the complete fuzzy graph in Figure 7.

In Figure 7, , , where . Therefore, Also, , , and

Since , then, by Definition 49, the fuzzy chromatic polynomial of the complete fuzzy graph isA fuzzy graph is a cycle and a fuzzy cycle as defined in [9, 32].

Definition 51 (see [9, 32]). Let be a fuzzy graph. Then(i)G is called a cycle if is a cycle;(ii)G is called a fuzzy cycle if is a cycle and unique such that .

Remark 52. If a fuzzy graph is cycle with n vertices, then , where is a cycle crisp graph with n vertices.

The following theorem is important for computing the fuzzy chromatic polynomial of a fuzzy graph which is cycle.

Theorem 53. Let be a fuzzy graph with vertices. Then is a cycle if and only ifwhere and are a complete crisp graph and cycle crisp graph with n vertices, respectively.

Proof. Let be a fuzzy graph with n vertices. Suppose be a cycle. Since is a cycle, is a cycle crisp graph. For , where L is a level set of , now , where and . Let us prove the theorem by considering three cases.
Case 1. Let , and since is a fuzzy graph with n vertices then by Theorem 39, we have
Case 2. Let , where ; since is a fuzzy graph then, by Theorem 40, we have and since G is cycle with n vertices, then, by Remark 52 and (15), we get
Case 3. Let ; since is in I and is a fuzzy graph then, by Theorem 41, Hence, the result holds.
Conversely, we shall prove it by contrapositive. Suppose is not a cycle. Then, by Definition 51, is not a cycle. This implies that . Hence,Therefore, if (14) is true, then is a cycle. This completes the proof.

Corollary 54. Let be a fuzzy graph. If is a fuzzy cycle with vertices; then (14) is true.

Proof. Let be a fuzzy cycle with vertices. Since is fuzzy cycle, then its is cycle. Then by Definition 51, is a cycle. Then by Theorem 53, the result is immediate.

Remark 55. The converse of Corollary 54 is not true. It can be seen from the following example.

Example 56. Consider the fuzzy graph given in Figure 8.

In Figure 8, clearly is a cycle. So, is cycle. For where , since G is cycle, then, by (14), the fuzzy chromatic polynomial of is But is not fuzzy cycle.

Remark 57. In general, the meaning of fuzzy chromatic polynomial of a fuzzy graph depends on the sense of the index . It can be interpreted that for lower values of more numbers of different k-colorings are obtained. On the other hand, for higher values of less number of different k-colorings are obtained. Therefore, the fuzzy chromatic polynomial sums up all this information so as to manage the fuzzy problem.

#### 5. Conclusions

In this paper, the concept of fuzzy chromatic polynomial of fuzzy graph with crisp and fuzzy vertex sets is introduced. The fuzzy chromatic polynomial of fuzzy graph is defined based on -cuts of the fuzzy graph. Some properties of the fuzzy chromatic polynomial of fuzzy graphs are investigated. The degree of fuzzy chromatic polynomial of a fuzzy graph is less than or equal to the number of vertices in fuzzy graph which is a significant difference from the crisp graph theory. Further, the fuzzy chromatic polynomial of fuzzy graph with fuzzy vertex set will decrease when the value of will increase. Also, more results on fuzzy chromatic polynomial of fuzzy graphs have been proved. The relation between the fuzzy chromatic polynomial of fuzzy graph and its underlying crisp graph and the relation between the fuzzy chromatic polynomial of fuzzy graph and complete crisp graph are established. Finally, the fuzzy chromatic polynomial for complete fuzzy graph and fuzzy cycle is studied. Also, the fuzzy chromatic polynomial of complete fuzzy graph is defined explicitly when . We are working on fuzzy chromatic polynomial based on different types of fuzzy coloring functions as an extension of this study.

#### Data Availability

The data used to support the findings of this study are included within the article.

#### Conflicts of Interest

The authors declare that there are no conflicts of interest regarding the publication of this paper.

#### Authors’ Contributions

Both authors contributed equally and significantly in writing this article. Both authors read and approved the final manuscript.

#### References

1. L. A. Zadeh, “Fuzzy sets,” Information and Computation, vol. 8, pp. 338–353, 1965. View at: Google Scholar | MathSciNet
2. C. M. Klein, “Fuzzy shortest paths,” Fuzzy Sets and Systems, vol. 39, no. 1, pp. 27–41, 1991. View at: Publisher Site | Google Scholar | MathSciNet
3. K. C. Lin and M. S. Chern, “The fuzzy shortest path problem and its most vital arcs,” Fuzzy Sets and Systems, vol. 58, no. 3, pp. 343–353, 1993. View at: Publisher Site | Google Scholar | MathSciNet
4. S. Okada and T. Soper, “A shortest path problem on a network with fuzzy arc lengths,” Fuzzy Sets and Systems, vol. 109, no. 1, pp. 129–140, 2000. View at: Publisher Site | Google Scholar | MathSciNet
5. S. M. Nayeem and M. Pal, “Shortest path problem on a network with imprecise edge weight,” Fuzzy Optimization and Decision Making, vol. 4, no. 4, pp. 293–312, 2005. View at: Publisher Site | Google Scholar | MathSciNet
6. A. Dey, A. Pal, and T. Pal, “Interval type 2 fuzzy set in fuzzy shortest path problem,” Mathematics, vol. 4, no. 4, pp. 1–19, 2016. View at: Google Scholar
7. A. Dey, R. Pradhan, A. Pal, and T. Pal, “A genetic algorithm for solving fuzzy shortest path problems with interval type-2 fuzzy arc lengths,” Malaysian Journal of Computer Science, vol. 31, no. 4, pp. 255–270, 2018. View at: Publisher Site | Google Scholar
8. A. Kaufmann, Introduction A La Theorie Des Sous-Ensembles Flous, vol. 1, Masson et Cie, Paris, 1973. View at: MathSciNet
9. A. Rosenfeld, “Fuzzy graphs,” in Fuzzy Sets and Their Applications, L. A. Zadeh, K. S. Fu, and M. Shimura, Eds., pp. 77–95, Academic Press, New York, NY, USA, 1975. View at: Google Scholar | MathSciNet
10. P. Bhattacharya, “Some remarks on fuzzy graphs,” Pattern Recognition Letters, vol. 6, no. 5, pp. 297–302, 1987. View at: Publisher Site | Google Scholar
11. K. R. Bhutani, “On automorphisms of fuzzy graphs,” Pattern Recognition Letters, vol. 9, no. 3, pp. 159–162, 1989. View at: Publisher Site | Google Scholar
12. J. N. Mordeson and P. S. Nair, “Cycles and cocycles of fuzzy graphs,” Information Sciences, vol. 90, no. 1-4, pp. 39–49, 1996. View at: Publisher Site | Google Scholar | MathSciNet
13. M. S. Sunitha and A. Vijayakumar, “A characterization of fuzzy trees,” Information Sciences, vol. 113, no. 3-4, pp. 293–300, 1999. View at: Publisher Site | Google Scholar | MathSciNet
14. M. S. Sunitha and A. Vijaya Kumar, “Complement of a fuzzy graph,” Indian Journal of Pure and Applied Mathematics, vol. 33, no. 9, pp. 1451–1464, 2002. View at: Google Scholar | MathSciNet
15. K. R. Bhutani and A. Rosenfeld, “Strong arcs in fuzzy graphs,” Information Sciences, vol. 152, pp. 319–322, 2003. View at: Publisher Site | Google Scholar | MathSciNet
16. S. Mathew and M. S. Sunitha, “Types of arcs in a fuzzy graph,” Information Sciences, vol. 179, no. 11, pp. 1760–1768, 2009. View at: Publisher Site | Google Scholar | MathSciNet
17. M. Akram, “Bipolar fuzzy graphs,” Information Sciences, vol. 181, no. 24, pp. 5548–5564, 2011. View at: Publisher Site | Google Scholar | MathSciNet
18. M. Akram and W. A. Dudek, “Interval-valued fuzzy graphs,” Computers & Mathematics with Applications, vol. 61, no. 2, pp. 289–299, 2011. View at: Publisher Site | Google Scholar | MathSciNet
19. J. N. Mordeson and P. S. Nair, Fuzzy Graphs and Fuzzy Hypergraphs, Physica-Verlag, Heidelberg, Germany, 2000. View at: MathSciNet
20. M. Ananthanarayanan and S. Lavanya, “Fuzzy graph coloring using α cuts,” International Journal of Engineering and Applied Sciences, vol. 4, no. 10, pp. 23–28, 2014. View at: Google Scholar
21. C. Eslahchi and B. N. Onagh, “Vertex-strength of fuzzy graphs,” International Journal of Mathematics and Mathematical Sciences, vol. 2006, Article ID 43614, 9 pages, 2006. View at: Publisher Site | Google Scholar | MathSciNet
22. S. Muñoz, M. T. Ortuño, J. Ramírez, and J. Yáñez, “Coloring fuzzy graphs,” Omega , vol. 33, no. 3, pp. 211–221, 2005. View at: Publisher Site | Google Scholar
23. A. Kishore and M. S. Sunitha, “Chromatic number of fuzzy graphs,” Annals of Fuzzy Mathematics and Informatics, vol. 7, no. 4, pp. 543–551, 2014. View at: Google Scholar | MathSciNet
24. A. Dey and A. Pal, “Vertex coloring of a fuzzy graph using alph cut,” International Journal of Management, vol. 2, no. 8, pp. 340–352, 2012. View at: Google Scholar
25. A. Dey and A. Pal, “Fuzzy graph coloring technique to classify the accidental zone of a traffic control,” Annals of Pure and Applied Mathematics, vol. 3, no. 2, pp. 169–178, 2013. View at: Google Scholar
26. A. Dey, R. Pradhan, A. Pal, and T. Pal, “The fuzzy robust graph coloring problem,” in Proceedings of the 3rd International Conference on Frontiers of Intelligent Computing:Theory and Applications (FICTA) 2014, vol. 327, pp. 805–813, Springer, 2015. View at: Publisher Site | Google Scholar
27. I. Rosyida, Widodo, C. R. Indrati, and K. A. Sugeng, “A new approach for determining fuzzy chromatic number of fuzzy graph,” Journal of Intelligent and Fuzzy Systems. Applications in Engineering and Technology, vol. 28, no. 5, pp. 2331–2341, 2015. View at: Publisher Site | Google Scholar | MathSciNet
28. S. Samanta, T. Pramanik, and M. Pal, “Fuzzy colouring of fuzzy graphs,” Afrika Matematika, vol. 27, no. 1-2, pp. 37–50, 2016. View at: Publisher Site | Google Scholar | MathSciNet
29. A. Dey, L. H. Son, P. K. K. Kumar, G. Selvachandran, and S. G. Quek, “New concepts on vertex and edge coloring of simple vague graphs,” Symmetry, vol. 10, no. 9, pp. 1–18, 2018. View at: Google Scholar
30. R. A. Brualdi, Introductory Combinatorics, Prentice Hall, 2009. View at: MathSciNet
31. R. J. Wilson, Introduction to Graph Theory, Pearson, England, 2010. View at: MathSciNet
32. S. Mathew, J. N. Mordeson, and D. S. Malik, “Fuzzy graphs,” in Fuzzy Graph Theory, vol. 363, pp. 13–83, Springer International Publishing AG, 2018. View at: Google Scholar

Copyright © 2019 Mamo Abebe Ashebo and V. N. Srinivasa Rao Repalle. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.