27 April 2020 in IEEE Access
In many practical problems, randomness and uncertainty simultaneously appear in one complex system or network. When graph theory is applied to these problems, these complex systems or networks are usually represented by uncertain random graphs, in which some edges exist with degrees in probability measure, and some other edges exist with degrees in uncertain measure. In this paper, we focus on the connectivity of uncertain random graphs with respect to vertices. We propose the concepts of k- vertex-connectivity index and the connectivity of an uncertain random graph. The former is the chance measure that an uncertain random graph is k-vertex-connected, and the latter is an uncertain random variable, which characterizes the connectivity of the uncertain random graph with respect to vertices. We discuss some properties of these concepts. Methods and formulas are also presented for calculating the k-vertex-connectivity index, and the distribution and expected value of the connectivity of an uncertain random graph.
24 March 2020 in IEEE Access
Connectivity is one of the most important concepts in graph theory. When graph theory is applied to complex systems with indeterminate factors, uncertainty and randomness are two basic types of indeterminacy. Therefore, the model of uncertain random graph was proposed via chance theory, in which some edges exist with degrees in probability measure and others exist with degrees in uncertain measure. This paper discusses the connectivity of an uncertain random graph with respect to edges. Concepts of k-connectivity index and edge-connectivity of an uncertain random graph are proposed. Methods and algorithms for calculating the k-connectivity index and the distribution of edge-connectivity are also proposed. In addition, some properties of them are discussed.
26 May 2021 in Soft Computing
24 July 2022 in Soft Computing
7 December 2022 in Research Square
Power networks, biological networks, and other networks are becoming more and more complex. And corresponding problems of these networks accompany by uncertainty, which can only rely on expert opinion. In practical applications, the dominating ability of these networks is often within the scope of the designer's consideration. It is more appropriate to use uncertain graphs to characterize these networks. And then it is necessary to explore the domination problem in uncertain graphs. As an important parameter, the minimum dominating set of graphs could be used to measure the dominating ability of some complex networks. In the paper, our discussion will focus on the minimum dominating set problem in uncertain graphs. We will first study the domination number of uncertain graphs and show the formulas for calculating the corresponding distribution and its numerical characteristics. Then two models are proposed to find the minimum dominating set in uncertain graphs. Besides, corresponding algorithms for and some examples are also shown.