On the significance of edges for connectivity in uncertain random graphs.

In practical applications of graph theory, indeterminacy factors always appear in graphs. 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 contributions of edges for connectivity of an uncertain random graph and proposes concepts about significance of edges, according to which edges are classified. In addition, this paper presents algorithms for calculating connectivity index and significance of edges of an uncertain random graph. Examples are given to illustrate algorithms and methods. [ABSTRACT FROM AUTHOR]