Results 21 to 30 of about 114 (106)
Some observations on the mildly Menger property and topological games
Filomat, 2022 In this paper, we defined two new games - the mildly Menger game and the compact-clopen game. In a zero-dimensional space, the Menger game is equivalent to the mildly Menger game and the compact-open game is equivalent to the compact-clopen game. An example is given for a space on which the mildly Menger game is undetermined.
Bhardwaj, M., Osipov, A. V.
openaire +3 more sources
Karpatsʹkì Matematičnì Publìkacìï, 2016 Coupled fixed point problems have attracted much attention in recent times. The aim of this paper is to extend the notions of E.A. property, CLR property and JCLR property for coupled mappings in Menger metric space and use this notions to generalizes ...
L. Ben Aoua, A. Aliouche
doaj +1 more source
The Menger and projective Menger properties of function spaces with the set-open topology [PDF]
Mathematica Slovaca, 2019 Abstract For a Tychonoff space X and a family λ of subsets of X, we denote by C λ(X) the space of all real-valued continuous functions on X with the set-open topology. A Menger space is a topological space in which for every sequence of open covers 𝓤1, 𝓤2, … of the space there are finite sets 𝓕1 ⊂ 𝓤1, 𝓕2 ⊂
openaire +3 more sources
Menger fractal structure with negative refraction and sound tunnelling properties
Materials Research Express, 2019 We construct new quasi-three-dimensional fractal acoustic metamaterials based on adoption of the Menger structure, which offers extraordinary parameters such as double-negative properties and a near-zero density.
Yu Liu +6 more
doaj +1 more source
Common fixed point theorem of six self-mappings in Menger spaces using (CLRST) property
Open Mathematics, 2018 In this paper, we study the existence and uniqueness of common fixed point of six self-mappings in Menger spaces by using the common limit range property (denoted by (CLRST)) of two pairs.
Liu Xiao-lan +4 more
doaj +1 more source
The menger-like property of the tree-width of infinite graphs
Journal of Combinatorial Theory, Series B, 1991 The tree-width of a (possibly infinite) graph G is the minimum n such that G may be decomposed into a ``tree-structure'' of pieces each with at most \(n+1\) vertices. We prove that if G has tree-width n, then G can be decomposed in such a way that for every \(k\geq 0\) and any two pieces P and Q of this ``tree-structure'' either there are k disjoint ...
Igor Kríz, Robin Thomas 0001
openaire +3 more sources
Flexible List Coloring of Graphs With Maximum Average Degree Less Than 3
Journal of Graph Theory, EarlyView.ABSTRACT In the flexible list coloring problem, we consider a graph G $G$ and a color list assignment L $L$ on G $G$, as well as a subset U ⊆ V ( G ) $U\subseteq V(G)$ for which each u ∈ U $u\in U$ has a preferred color p ( u ) ∈ L ( u ) $p(u)\in L(u)$. Our goal is to find a proper L $L$‐coloring ϕ $\phi $ of G $G$ such that ϕ ( u ) = p ( u ) $\phi (u)=
Richard Bi, Peter Bradshaw
wiley +1 more source
The Strong Nash‐Williams Orientation Theorem for Rayless Graphs
Journal of Graph Theory, EarlyView.ABSTRACT In 1960, Nash‐Williams proved his strong orientation theorem that every finite graph has an orientation in which the number of arc‐disjoint directed paths between any two vertices is at least half the number of undirected edge‐disjoint paths between them (rounded down).
Max Pitz, Jacob Stegemann
wiley +1 more source
Journal of Surfactants and Detergents, EarlyView.ABSTRACT Controllable DNA condensation is important for nucleic‐acid packaging and non‐viral gene‐delivery systems. This study aimed to determine how the composition of mixed nonionic C12E10 and cationic gemini C12C6C12Br2 surfactants regulates DNA condensation, structure, thermodynamics, and cytotoxicity.
Bo Wang +3 more
wiley +1 more source