In practical applications of graph theory, non-deterministic factors are frequently encountered. This paper employs uncertainty theory to deal with non-deterministic factors in problems of graph connectivity. The concepts of uncertain graph and connectedness index of uncertain graph are proposed in this paper. It presents two algorithms to calculate connectedness index of an uncertain graph.
No takes yet. Share an insight, caveat, or question.
Yuan Gao (2013) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: