Regularity index of uncertain graph
نویسنده
چکیده
With the increasingly development of system complexity, there is a variety of indeterminacy in the practical applications of graph theory. In this paper, the uncertainty theory is applied to study the regularity of the uncertain graph. Based on the uncertainty theory, the concept of regularity index of uncertain graph and its calculation method are raised with an illustration of the calculation method as the final part in the paper.
منابع مشابه
Regularity Index of Uncertain Graph
ith the increasingly development of system complexity, there is a variety of uncertainties in the practical applications of graph theory. In this paper, the uncertainty theory is applied to study the regularity of the uncertain graph. Based on the uncertainty theory, the concept of regularity index of uncertain graph and its calculation method are raised with an illustration of the calculation ...
متن کاملON THE MATCHING NUMBER OF AN UNCERTAIN GRAPH
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...
متن کاملBounding cochordal cover number of graphs via vertex stretching
It is shown that when a special vertex stretching is applied to a graph, the cochordal cover number of the graph increases exactly by one, as it happens to its induced matching number and (Castelnuovo-Mumford) regularity. As a consequence, it is shown that the induced matching number and cochordal cover number of a special vertex stretching of a graph G are equal provided G is well-covered bipa...
متن کاملRegularity of second power of edge ideals
Let G be a graph with edge ideal I(G). Benerjee and Nevo proved that for every graph G, the inequality reg(I(G)2)≤reg(I(G))+2 holds. We provide an alternative proof for this result.
متن کاملHamilton Index and Its Algorithm of Uncertain Graph
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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Intelligent and Fuzzy Systems
دوره 27 شماره
صفحات -
تاریخ انتشار 2014