نتایج جستجو برای: closed graph
تعداد نتایج: 313919 فیلتر نتایج به سال:
Abstract For a graph G , two dominating sets D and $$D'$$ D ′ in non-negative integer k the set is said to -transform if there sequence $$D_0,\ldots ,D_\ell $$ 0 , … ℓ ...
Graph theory based methods are powerful means for representing structural systems so that their geometry and topology can be understood clearly. The combination of graph theory based methods and some metaheuristics can offer effective solutions for complex engineering optimization problems. This paper presents a Charged System Search (CSS) algorithm for the free shape optimizations of thin-wall...
the notion of a probabilistic metric space corresponds to thesituations when we do not know exactly the distance. probabilistic metric space was introduced by karl menger. alsina, schweizer and sklar gave a general definition of probabilistic normed space based on the definition of menger [1]. in this note we study the pn spaces which are topological vector spaces and the open mapping an...
Let G be a connected simple graph. We prove that G is a closed graph if and only if G is a proper interval graph. As a consequence we obtain that there exist linear-time algorithms for closed graph recognition.
in the present paper, we study some properties of fuzzy norm of linear operators. at first the bounded inverse theorem on fuzzy normed linear spaces is investigated. then, we prove hahn banach theorem, uniform boundedness theorem and closed graph theorem on fuzzy normed linear spaces. finally the set of all compact operators on these spaces is studied.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید