نتایج جستجو برای: closed fuzzy matroid
تعداد نتایج: 212866 فیلتر نتایج به سال:
Abstract. The purpose of the paper is to introduce and study the concepts of fuzzy generalized γ closed sets and study their basic properties in fuzzy topological spaces. Moreover, in this paper we define fuzzy γT1⁄2 spaces in which every fuzzy generalized γ continuous is fuzzy γ continuous. In addition, we have also introduced and studied fuzzy generalized γ connectedness and fuzzy generalized...
In this paper we introduce intuitionistic fuzzy contra regular weakly generalized open mappings and intuitionistic fuzzy contra regular weakly generalized closed mappings. We investigate some of their properties.
In this paper, we studied and introduce a new class of fuzzy sets called fuzzy strongly g *super closed sets is introduced and explore some of its characterization.
The aim of this paper is to design a single input PI fuzzy controller for a nonlinear and time-varying plant – the biogas production rate in the anaerobic digestion of organic waste in waste water treatment. The main contributions are the design of the SI FC, the study of the closed loop control system performance and the estimation of the advantages of the SI FC system in comparison to other s...
Abstract The output feedback stabilization for discrete nonlinear systems is studied based on T-S fuzzy model in this paper. Firstly, a concept of the efficient mutual non-neighboring rule group (EMNNRG) is presented. Secondly, by using the scheme of parallel distributed compensation (PDC) and the piecewise fuzzy Lyapunov function, the stability of the closed-loop discrete T-S fuzzy control sys...
Motivated by work in graph theory, we define the fixing number for a matroid. We give upper and lower bounds for fixing numbers for a general matroid in terms of the size and maximum orbit size (under the action of the matroid automorphism group). We prove the fixing numbers for the cycle matroid and bicircular matroid associated with 3-connected graphs are identical. Many of these results have...
A matroid is sticky if any two of its extensions by disjoint sets can be glued together along the common restriction (that is, they have an amalgam). The sticky matroid conjecture asserts that a matroid is sticky if and only if it is modular. Poljak and Turzı́k proved that no rank-3 matroid having two disjoint lines is sticky. We show that, for r ≥ 3, no rank-r matroid having two disjoint hyperp...
We prove that three matroid optimisation problems, namely, the matchoid, matroid parity and matroid matching problems, all reduce to the b-matching problem when the matroids concerned are laminar. We then use this equivalence to show that laminar matroid parity polytopes are affinely congruent to b-matching polytopes, and have Chvátal rank equal to one. On the other hand, we prove that laminar ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید