共查询到20条相似文献,搜索用时 156 毫秒
1.
2.
3.
4.
6.
由两个模糊数的隶属函数确定三个面积,据此建立一个对模糊数进行大小比较的可能度计算公式.公式表达式非常简洁,同时还具有传递性、互补性等诸多良好的性质,因而具有很强的实用性和可操作性.对给定的一组模糊数,先利用两两比较的结果建立一个可能度矩阵,同时给出基于可能度矩阵的模糊数排序算法.最后给出一个排序算法的实例. 相似文献
7.
模糊粗糙集及粗糙模糊集的模糊度 总被引:5,自引:0,他引:5
1965年,Zadeh提出了Fuzzy集理论,1982年,Z.Pawlak提出Rough集理论。将二者结合而形成的模糊粗糙集(FR集)及粗糙模糊集(RF集)近年来越来越受到国际学术界的关注。本文所研究的FR集及RF集的模糊度,是对FR集及RF集模糊程度的一种度量,进而引进了相应的明可夫斯基距离,明可夫斯基模糊度和Shannon模糊度。 相似文献
8.
区别度诱导的广义模糊熵 总被引:1,自引:1,他引:0
广义模糊熵是模糊熵在广义模糊补意义下的推广,本文从区别度的角度给出几个生成广义模糊熵的途径;通过一个具体的区别度公式得到了相应的一些广义模糊熵表达式,为实际使用广义模糊熵做了一些理论上的铺垫. 相似文献
9.
10.
11.
The connectivity and the line connectivity numbers of a graph and of its line graph are dependent on each other. Another important related notion is the cyclic connectedness, and we establish here a strong relationship between the cyclic connectivity number and the cyclic line connectivity number of a graph and of its line graph. Moreover, we introduce a related new notion involving cliques instead of cycles and undertake a similar investigation. 相似文献
12.
In this paper, we characterize the graphs with infinite cyclic edge connectivity. Then we design an efficient algorithm to determine whether a graph has finite cyclic edge connectivity or infinite cyclic edge connectivity. 相似文献
13.
Damon Mosk-Aoyama 《Operations Research Letters》2008,36(6):677-679
The algebraic connectivity of a graph, which is the second-smallest eigenvalue of the Laplacian of the graph, is a measure of connectivity. We show that the problem of adding a specified number of edges to an input graph to maximize the algebraic connectivity of the augmented graph is NP-hard. 相似文献
14.
In a search for triangle-free graphs with arbitrarily large chromatic numbers, Mycielski developed a graph transformation that transforms a graph G into a new graph μ(G), which is called the Mycielskian of G. This work investigates the vertex connectivity and arc connectivity of the Mycielskian of a digraph D. This generalizes the recent results due to Balakrishnan and Raj [R. Balakrishnan, S.F. Raj, Connectivity of the Mycielskian of a graph, Discrete Math, 308 (2008), 2607–2610]. 相似文献
15.
1.IntroductionAgraphG=(V,E)meansafinitegraphwithoutloopsandmultipleedgeswithvertexsetVandedgesetE,theclassicaledgeconnectivityA(G)ofGistheminimumsizeofasetUofedgessuchthatG--Uisdisconnected,andsuchasetUiscalledaoutsetofG.Notethatintheabovedefinition,absolutelynoconditionsorrestrictionsareimposedeitheronthecomponelltsofG--UoronthesetU.ThusitwouldseemnaturaltogeneralizetheconceptofedgeconnectivitybyintroducingsomeconditionsorrestrictionsonthecomponentsofG--Uand/orthesetU.Asageneralizatio… 相似文献
16.
Patrick Bahls 《Discrete Mathematics》2009,309(8):2250-3472
We introduce the notion of the asymptotic connectivity of a graph by generalizing to infinite graphs average connectivity as defined by Beineke, Oellermann, and Pippert. Combinatorial and geometric properties of asymptotic connectivity are then explored. In particular, we compute the asymptotic connectivity of a number of planar graphs in order to determine the extent to which this measure correlates with the large-scale geometry of the graph. 相似文献
17.
限制边连通度作为边连通度的推广,是计算机互连网络可靠性的一个重要度量.Superλ-′是比限制边连通度更精确的一个网络可靠性指标.一个图是Superλ-′的,如果它的任一最小限制边割都孤立一条有最小边度的边.本文考虑一类重要的网络模型-无向K autz图UK(d,n)的限制边连通度λ,′证明了当d 3,n 2时,λ(′UK(d,n))=4d-4,并进一步指出此时的UK(d,n)是Superλ-′的. 相似文献
18.
The connectedness and acyclicity levels are presented for a fuzzy graph. Several fuzzy tree definitions are given too, and their relations with previous studies on the matter are analyzed. 相似文献
19.