Affordable Access

deepdyve-link
Publisher Website

On the significance of edges for connectivity in uncertain random graphs

Authors
  • Li, Hao1
  • Gao, Xin2
  • 1 Renmin University of China,
  • 2 North China Electric Power University,
Type
Published Article
Journal
Soft Computing
Publisher
Springer-Verlag
Publication Date
May 26, 2021
Pages
1–9
Identifiers
DOI: 10.1007/s00500-021-05813-2
PMID: 34075307
PMCID: PMC8152216
Source
PubMed Central
Keywords
Disciplines
  • Methodologies and Application
License
Unknown

Abstract

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.

Report this publication

Statistics

Seen <100 times