In the application of classical graph theory, there always are various indeterministic factors. This study studies the indeterministic factors in the connected graph by employing the uncertainty theory. First, this study puts forward two concepts: generalized uncertain graph and its connectivity index. Second, it presents a new algorithm to compute the connectivity index of an uncertain graph and generalized uncertain graph and verify this algorithm with typical examples. In addition, it proposes the definition and algorithm of -connectivity index of generalized uncertain graph and verifies the stability and efficiency of this new algorithm by employing numerical experiments.
Uncertain differential equations are important mathematical models in uncertain environments. This paper investigates uncertain multi-dimensional and multiple-factor differential equations. First, the solvability of the equations is analyzed. The -path distributions and expected values of solutions are given. Then, structure preserving uncertain differential equations, uncertain Hamiltonian systems driven by Liu processes, which possess a kind of uncertain symplectic structures, are presented. A symplectic scheme with six-order accuracy and a Yao-Chen algorithm are applied to design an algorithm to solve uncertain Hamiltonian systems. At last, numerical experiments are given to investigate four uncertain Hamiltonian systems, which highlight the efficiency of our algorithm.