共查询到18条相似文献,搜索用时 330 毫秒
1.
2.
研究了闭正则模糊拟阵的子拟阵的正则性等性质.得到了闭正则模糊拟阵的两种子拟阵的正则性等性质,即k-子拟阵为闭正则模糊拟阵,限制子拟阵不是闭正则模糊拟阵,给出了闭正则模糊拟阵的收缩拟阵为闭正则模糊拟阵等结论. 相似文献
3.
4.
对两种初等模糊拟阵和基本截片模糊拟阵的定义进行了比较,研究了它们之间的关系.研究了初等模糊拟阵的若干性质,得到了初等模糊拟阵和基本截片模糊拟阵为闭正则模糊拟阵等结论,给出了初等模糊拟阵的等价刻画以及初等模糊拟阵与其截拟阵之间的关系. 相似文献
5.
本文主要方法是通过基本序列、导出拟阵序列和模糊集分解定理,将模糊圈的研究转化为对圈子集套和数组的研究。在闭模糊拟阵中,我们得出三个结论:以同一集合为支撑集的模糊圈的最大模糊圈总是存在;以同一子集串为圈子集套的模糊圈的最大模糊圈不一定存在。但是,找到了存在最大模糊圈的充要条件;以同一集合为支撑集的模糊圈的最小模糊圈,以同一子集串为圈子集套的模糊圈的最小模糊圈都是不存在的。但它们的最小模糊势是存在的,而且找出了计算最小模糊势的公式。我们构造了两个算法:一是构造支撑集最大模糊圈算法。通过这个算法可构造出支撑集最大模糊圈,同时计算出其最大模糊势;二是判断和构造圈子集套最大模糊圈算法。通过这个算法首先判断最大模糊圈是否存在,如果存在就可以找出圈子集套最大模糊圈同时计算出最大模糊势。 相似文献
6.
本文的研究方法主要是将模糊拟阵问题转化为普通拟阵问题来研究的方法。本文首先建立独立子集套概念,并使用这个概念和独立集函数概念构建了闭模糊拟阵的充要条件和模糊独立集的充要条件;然后,本文仔细分析了模糊基的性质,找到了一个使用独立子集套和独立集函数来描述的模糊基的充要条件;最后,利用模糊基的这个充要条件提出并证明了闭正规模糊拟阵的充要条件。 相似文献
8.
9.
刘文斌 《数学的实践与认识》2013,43(10)
模糊拟阵的基图是模糊拟阵的基本概念.在准模糊图拟阵的基础上,讨论了准模糊图拟阵基图的一些基本性质,得到了相关的几个结论,这些结论有利于进一步研究模糊拟阵的其它性质. 相似文献
10.
《模糊系统与数学》2019,(6)
本文主要采用通过导出拟阵来研究模糊拟阵的方法,探讨模糊拟阵模糊圈的性质和构造。这种方法的基本原理是两条:闭模糊拟阵可以由其导出拟阵序列和基本序列唯一确定,而模糊圈可以被分解为导出拟阵的圈和独立子集套。借助这种方法,本文主要做了三方面工作:一是讨论了模糊拟阵的模糊圈集和导出拟阵圈集之间的关系。比如模糊圈、初等模糊圈和最大初等模糊圈与导出拟阵圈之间的关系等;二是基于模糊圈和导出拟阵圈之间的关系,定义了导出拟阵圈函数和导出拟阵圈子集套两个概念。然后,详细研究了利用这两个概念来构造模糊圈的方法。同时,分析了在圈子集套和数列满足什么条件时,这种方法有效;三是分别用导出拟阵圈和圈子集套给出了准模糊图拟阵和精细模糊拟阵的充要条件。 相似文献
11.
In this paper, the generalized forms of the fuzzy core and the Shapley function for dynamic fuzzy games on matroids are given.
An equivalent form of the fuzzy core is researched. In order to better understand the fuzzy core and the Shapley function
for dynamic fuzzy games on matroids, we pay more attention to study three kinds of dynamic fuzzy games on matroids, which
are named as fuzzy games with multilinear extension form, with proportional value and with Choquet integral form, respectively.
Meantime, the relationship between the fuzzy core and the Shapley function for dynamic fuzzy games on matroids is researched,
which coincides with the crisp case. 相似文献
12.
Frame matroids and lifted‐graphic matroids are two interesting generalizations of graphic matroids. Here, we introduce a new generalization, quasi‐graphic matroids, that unifies these two existing classes. Unlike frame matroids and lifted‐graphic matroids, it is easy to certify that a 3‐connected matroid is quasi‐graphic. The main result is that every 3‐connected representable quasi‐graphic matroid is either a lifted‐graphic matroid or a frame matroid. 相似文献
13.
《Discrete Mathematics》2023,346(2):113222
Hypergraphic matroids were studied first by Lorea [23] and later by Frank et al. [11]. They can be seen as generalizations of graphic matroids. Here we show that several algorithms developed for the graphic case can be extended to hypergraphic matroids. We treat the following: the separation problem for the associated polytope, testing independence, separation of partition inequalities, computing the rank of a set, computing the strength, computing the arboricity and network reinforcement. 相似文献
14.
15.
《Discrete Mathematics》2022,345(6):112830
Given a matroid together with a coloring of its ground set, a subset of its elements is called rainbow colored if no two of its elements have the same color. We show that if an n-element rank r binary matroid M is colored with exactly r colors, then M either contains a rainbow colored circuit or a monochromatic cocircuit. As the class of binary matroids is closed under taking duals, this immediately implies that if M is colored with exactly colors, then M either contains a rainbow colored cocircuit or a monochromatic circuit. As a byproduct, we give a characterization of binary matroids in terms of reductions to partition matroids.Motivated by a conjecture of Bérczi, Schwarcz and Yamaguchi, we also analyze the relation between the covering number of a binary matroid and the maximum number of colors or the maximum size of a color class in any of its rainbow circuit-free colorings. For simple graphic matroids, we show that there exists a rainbow circuit-free coloring that uses each color at most twice only if the graph is -sparse, that is, it is independent in the 2-dimensional rigidity matroid. Furthermore, we give a complete characterization of minimally rigid graphs admitting such a coloring. 相似文献
16.
Glad Deschrijver 《Fuzzy Sets and Systems》2011,181(1):88-101
In this paper we study t-norms on the lattice of closed subintervals of the unit interval. Unlike for t-norms on a product lattice for which there exists a straightforward characterization of t-norms which are join-morphisms, respectively meet-morphisms, the situation is more complicated for t-norms in interval-valued fuzzy set theory. In previous papers several characterizations were given of t-norms in interval-valued fuzzy set theory which are join-morphisms and which satisfy additional properties, but little attention has been paid to meet-morphisms. Therefore, in this paper, we focus on t-norms which are meet-morphisms. We consider a general class of t-norms and investigate under which conditions t-norms belonging to this class are meet-morphisms. We also characterize the t-norms which are both a join- and a meet-morphism and which satisfy an additional border condition. 相似文献
17.
18.
《Communications in Nonlinear Science & Numerical Simulation》2014,19(3):710-725
In this paper, we define a differentiability of the type-2 fuzzy number-valued functions. The definition is based on type-2 Hukuhara difference which is defined in the paper as well. The related theorem of the differentiability of the type-2 fuzzy number-valued functions is derived. In addition, a parametric closed form of the perfect triangular quasi type-2 fuzzy numbers is introduced, and finally, the applicability and an approach to solving type-2 fuzzy differential equations are illustrated using some examples and cases. 相似文献