An uncertain chromatic number of an uncertain graph based on $$\alpha $$ α -cut coloring

Abstract

An uncertain graph is a graph in which the edges are indeterminate and the existence of edges are characterized by belief degrees which are uncertain measures. This paper aims to bring graph coloring and uncertainty theory together. A new approach for uncertain graph coloring based on an $$\alpha $$ -cut of an uncertain graph is introduced in this paper. Firstly, the concept of $$\alpha $$ -cut of uncertain graph is given and some of its properties are explored. By means of $$\alpha $$ -cut coloring, we get an $$\alpha $$ -cut chromatic number and examine some of its properties as well. Then, a fact that every $$\alpha $$ -cut chromatic number may be a chromatic number of an uncertain graph is obtained, and the concept of uncertain chromatic set is introduced. In addition, an uncertain chromatic algorithm is constructed. Finally, a real-life decision making problem is given to illustrate the application of the uncertain chromatic set and the effectiveness of the uncertain chromatic algorithm.