نتایج جستجو برای: mixed g monotone property
تعداد نتایج: 808387 فیلتر نتایج به سال:
In this paper, we prove tripled fixed point theorem for nonlinear (φ,ψ)-contractive on partially ordered complete metric spaces without mixed monotone. We also prove the uniqueness of tripled fixed point of such mappings. Further, we extend the recent results of the tripled fixed point theorem of the given mapping with mixed monotone in partially orderd metric spaces.
Given a property P of graphs, write Pn for the set of graphs with vertex set [n] having property P. We call |Pn| the speed of P. Recent research has shown that the speed of a monotone or hereditary property P can be a constant, polynomial, or exponential function of n, and the structure of the graphs in P can then be well described. Similarly, |Pn| can be of the form n(1−1/k+o(1))n or 2(1−1/k+o...
A graph G = (V,E) is said to be saturated with respect to a monotone increasing graph property P, if G / ∈ P but G ∪ {e} ∈ P for every e ∈ ( V 2 ) \ E. The saturation game (n,P) is played as follows. Two players, called Mini and Max, progressively build a graph G ⊆ Kn, which does not satisfy P. Starting with the empty graph on n vertices, the two players take turns adding edges e ∈ ( V (Kn) 2 )...
A metric space (X, d) is called c-monotone if there is a linear order < on X and c > 0 such that d(x, y) 6 c d(x, z) for all x < y < z in X. A brief account of investigation of monotone spaces including applications is presented. 1 Monotone and σ-Monotone Spaces. In [6] I investigated existence of sets in Euclidean spaces that have large Hausdorff dimension and yet host no continuous finite Bor...
Given a monotone graph property P consider p P the proba bility that a random graph with edge probability p will have P The function d p P dp is the key to understanding the threshold behavior of the property P We show that if d p P dp is small corresponding to a non sharp threshold then there is a list of graphs of bounded size such that P can be approximated by the property of having one of t...
For a given simple graph G, S(G) is defined to be the set of real symmetric matrices A whose (i, j)th entry is nonzero whenever i 6= j and ij is an edge in G. In [2], ξ(G) is defined to be the maximum corank (i.e., nullity) among A ∈ S(G) having the Strong Arnold Property; ξ is used to study the minimum rank/maximum eigenvalue multiplicity problem for G. Since ξ is minor monotone, the graphs G ...
For a given simple graph G, S(G) is defined to be the set of real symmetric matrices A whose (i, j)th entry is nonzero whenever i 6= j and ij is an edge in G. In [2], ξ(G) is defined to be the maximum corank (i.e., nullity) among A ∈ S(G) having the Strong Arnold Property; ξ is used to study the minimum rank/maximum eigenvalue multiplicity problem for G. Since ξ is minor monotone, the graphs G ...
There has been substantial interest in estimating the value of a graph parameter, i.e., of a real function defined on the set of finite graphs, by sampling a randomly chosen substructure whose size is independent of the size of the input. Graph parameters that may be successfully estimated in this way are said to be testable or estimable, and the sample complexity qz = qz(ε) of an estimable par...
A variational inequality problem (VIP) satisfying a constraint qual-iication can be reduced to a mixed complementarity problem (MCP). Monotonicity of the VIP implies that the MCP is also monotone. Introducing regularizing perturbations, a sequence of strictly monotone mixed complementarity problems is generated. It is shown that, if the original problem is solvable, the sequence of computable i...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید