Uncertain vertex coloring problem

Abstract

This paper investigates the vertex coloring problem in an uncertain graph in which all vertices are deterministic, while all edges are not deterministic and exist with some degree of belief in uncertain measures. The concept of the maximal uncertain independent vertex set of an uncertain graph is first introduced. We then present a degree of belief rule to obtain the family of maximal uncertain independent vertex sets. Based on the maximal uncertain independent vertex set, some properties of the separation degree of an uncertain graph are discussed. Following that, the concept of an uncertain chromatic set is introduced. Then, a maximum separation degree algorithm is derived to obtain the uncertain chromatic set. Finally, numerical examples are presented to demonstrate the application of the vertex coloring problem in uncertain graphs and the effectiveness of the maximum separation degree algorithm.

Rosyida I, Widodo, Indrati C, Sugeng K (2016a) An \(\alpha \)-cut chromatic number of a total uncertain graph and its properties. In: Proceedings of the 7th SEAMS UGM international conference on mathematics and its applications 2015, pp 1–8Google Scholar