Results 1 to 10 of about 1,181,505 (283)

A spectral method for retrieving cloud optical thickness and effective radius from surface-based transmittance measurements [PDF]

Atmospheric Chemistry and Physics, 2011
We introduce a new spectral method for the retrieval of optical thickness and effective radius from cloud transmittance that relies on the spectral slope of the normalized transmittance between 1565 nm and 1634 nm, and on cloud transmittance at a visible
P. J. McBride, K. S. Schmidt, P. Pilewskie, A. S. Kittelman, D. E. Wolfe   +4 more
doaj   +1 more source

A sharp upper bound on the spectral radius of a nonnegative k-uniform tensor and its applications to (directed) hypergraphs

Journal of Inequalities and Applications, 2020
In this paper, we obtain a sharp upper bound on the spectral radius of a nonnegative k-uniform tensor and characterize when this bound is achieved. Furthermore, this result deduces the main result in [X. Duan and B.
Chuang Lv, Lihua You, Xiao-Dong Zhang
doaj   +1 more source

On the distance α-spectral radius of a connected graph

Journal of Inequalities and Applications, 2020
For a connected graph G and α ∈ [ 0 , 1 ) $\alpha \in [0,1)$ , the distance α-spectral radius of G is the spectral radius of the matrix D α ( G ) $D_{\alpha }(G)$ defined as D α ( G ) = α T ( G ) + ( 1 − α ) D ( G ) $D_{\alpha }(G)=\alpha T(G)+(1-\alpha )
Haiyan Guo, Bo Zhou
doaj   +1 more source

Automatic Continuity of Dense Range Homomorphisms into Multiplicatively Semisimple Complete Normed Algebras [PDF]

مجلة التربية والعلم, 2014
The following open problem state that: If  is a dense range homomorphism from Banach algebra into Banach algebra  such that  is semisimple. Is  automatically continuous?
RUQAYAH BALO
doaj   +1 more source

Some sufficient conditions on hamilton graphs with toughness

Frontiers in Computational Neuroscience, 2022
Let G be a graph, and the number of components of G is denoted by c(G). Let t be a positive real number. A connected graph G is t-tough if tc(G − S) ≤ |S| for every vertex cut S of V(G). The toughness of G is the largest value of t for which G is t-tough,
Gaixiang Cai, Tao Yu, Huan Xu, Guidong Yu, Guidong Yu   +4 more
doaj   +1 more source

Cliques and the spectral radius

Journal of Combinatorial Theory, Series B, 2007
We present a number of relations involving the number of cliques in a graph and its spectral radius.
Béla Bollobás, Vladimir Nikiforov 0001
openaire   +2 more sources

Spectral Radius Formulas Involving Generalized Aluthge Transform

Journal of Function Spaces, 2022
In this paper, we aim to develop formulas of spectral radius for an operator S in terms of generalized Aluthge transform, numerical radius, iterated generalized Aluthge transform, and asymptotic behavior of powers of S.
Zhiqiang Zhang, Muhammad Saeed Akram, Javariya Hyder, Ghulam Farid, Tao Yan   +4 more
doaj   +1 more source

On the joint spectral radius. II [PDF]

Proceedings of the American Mathematical Society, 1992
In this paper we show that if T =
Chō, Muneo, Huruya, Tadasi, Wrobel, Volker   +2 more
openaire   +2 more sources

On the Distance Spectral Radius of Trees with Given Degree Sequence

Discussiones Mathematicae Graph Theory, 2020
We consider the problem of maximizing the distance spectral radius and a slight generalization thereof among all trees with some prescribed degree sequence.
Dadedzi Kenneth, Misanantenaina Valisoa Razanajatovo, Wagner Stephan   +2 more
doaj   +1 more source

On the Joint Spectral Radius

, 2022
minor additions, 15 pages, to be submitted to a Springer volume in memory of Jean ...
openaire   +2 more sources