On the Stability of Wavelet and Gabor Frames (Riesz Bases).
Multiple solutions of -Laplacian with Neumann and Robin boundary conditions for both resonance and oscillation problem.
Existence of local saddle points for a new augmented Lagrangian function.
Stein open subsets with analytic complements in compact complex spaces
Let Y be an open subset of a reduced compact complex space X such that X - Y is the support of an effective divisor D. If X is a surface and D is an effective Weil divisor, we give sufficient conditions so that Y is Stein. If X is of pure dimension d ≥ 1 and X - Y is the support of an effective Cartier divisor D, we show that Y is Stein if Y contains no compact curves, for all i > 0, and for every point x₀ ∈ X-Y there is an n ∈ ℕ such that is empty or has dimension 0, where is the map from...
On compact-covering and sequence-covering images of metric spaces
Gradient estimates for a nonlinear equation on complete noncompact manifolds
Let be a complete noncompact Riemannian manifold. We consider gradient estimates on positive solutions to the following nonlinear equation in , where , are two real constants and , is a smooth real valued function on and . When is finite and the -Bakry-Emery Ricci tensor is bounded from below, we obtain a gradient estimate for positive solutions of the above equation. Moreover, under the assumption that -Bakry-Emery Ricci tensor is bounded from below and is bounded from above,...
A fuzzy shape database to support conceptual design
The Minimum Spectral Radius of Signless Laplacian of Graphs with a Given Clique Number
In this paper we observe that the minimal signless Laplacian spectral radius is obtained uniquely at the kite graph PKn−ω,ω among all connected graphs with n vertices and clique number ω. In addition, we show that the spectral radius μ of PKm,ω (m ≥ 1) satisfies [...] More precisely, for m > 1, μ satisfies the equation [...] where [...] and [...] . At last the spectral radius μ(PK∞,ω) of the infinite graph PK∞,ω is also discussed.
On The Determinant of q-Distance Matrix of a Graph
In this note, we show how the determinant of the q-distance matrix Dq(T) of a weighted directed graph G can be expressed in terms of the corresponding determinants for the blocks of G, and thus generalize the results obtained by Graham et al. [R.L. Graham, A.J. Hoffman and H. Hosoya, On the distance matrix of a directed graph, J. Graph Theory 1 (1977) 85-88]. Further, by means of the result, we determine the determinant of the q-distance matrix of the graph obtained from a connected weighted graph...
Some estimates for commutators of Riesz transform associated with Schrödinger type operators
Let be a Schrödinger operator and let be a Schrödinger type operator on , where is a nonnegative potential belonging to certain reverse Hölder class for . The Hardy type space is defined in terms of the maximal function with respect to the semigroup and it is identical to the Hardy space established by Dziubański and Zienkiewicz. In this article, we prove the -boundedness of the commutator generated by the Riesz transform , where , which is larger than the...
An efficient connected dominating set algorithm in wsns based on the induced tree of the crossed cube
The connected dominating set (CDS) has become a well-known approach for constructing a virtual backbone in wireless sensor networks. Then traffic can forwarded by the virtual backbone and other nodes turn off their radios to save energy. Furthermore, a smaller CDS incurs fewer interference problems. However, constructing a minimum CDS is an NP-hard problem, and thus most researchers concentrate on how to derive approximate algorithms. In this paper, a novel algorithm based on the induced tree of...
Page 1