Uncertain graphs are employed to describe graph models with indeterministicinformation that produced by human beings. This paper aims to study themaximum matching problem in uncertain graphs.The number of edges of a maximum matching in a graph is called matching numberof the graph. Due to the existence of uncertain edges, the matching number of an uncertain graph is essentially an uncertain var...

A graph containing some edges with probability measures and other uncertain is referred to as an random graph. Numerous real-world problems in social networks transportation can be boiled down optimization graphs. Actually, information graphs always asymmetric. Regularization a common problem theory, the regularity index fundamentally measurable indicator of Therefore, this paper investigates w...

This paper proposes a concept of uncertain random graph in which some edges exist with some degrees in probability measure and others exist with some degrees in uncertain measure, and discusses the connectivity index of an uncertain random graph. In addition, this paper presents a concept uncertain random network in which some weights are random variables and others are uncertain variables, and...

Uncertain graphs are prevalent in several applications including communications systems, biological databases and social networks. The ever increasing size of the underlying data renders both graph storage and query processing extremely expensive. Sparsification has often been used to reduce the size of deterministic graphs by maintaining only the important edges. However, adaptation of determi...

Graph theory has an important role in the area of applications of networks and clustering‎. ‎In the case of dealing with uncertain data‎, ‎we must utilize ambiguous data such as fuzzy value‎, ‎fuzzy interval value or values of fuzzy number‎. ‎In this study‎, ‎values of fuzzy number were used‎. ‎Initially‎, ‎we utilized the fuzzy number value fuzzy relation and then proposed fuzzy number-value f...

In practical applications of graph theory, uncertain factors are frequently encountered. In this paper, the uncertainty theory is employed to deal with uncertain factors in uncertain graph, in which whether two vertices are joined by an edge cannot be completely determined. In order to show how likely an uncertain graph is Hamiltonian, the concept of Hamilton index of uncertain graph is propose...

The expectative sub-graph isomorphism of uncertain attribute graph is based on the analysis of complex network structure and the characteristic of uncertain attribute graph. The expectative sub-graph isomorphism of uncertain attribute graph is only one threshold value as constraint conditions. The method is simple, but the computation is large amount. Therefore, this paper brings in the definit...