Results 11 to 20 of about 479,399 (272)

On the spectral radius and energy of signless Laplacian matrix of digraphs. [PDF]

Heliyon, 2022
Ganie HA, Shang Y.
europepmc   +2 more sources

Spectral radius formulae [PDF]

Proceedings of the Edinburgh Mathematical Society, 1979
If A is a complex Banach algebra (not necessarily unital) and x∈A, σ(x) will denote the spectrum and spectral radius of x in A. If I is a closed two-sided ideal in A let x + I denote the coset in the quotient algebra A/I containing x ...
Murphy, G. J., West, T. T.
openaire   +2 more sources

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

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

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

On the α-Spectral Radius of Uniform Hypergraphs

Discussiones Mathematicae Graph Theory, 2020
For 0 ≤ α ---lt--- 1 and a uniform hypergraph G, the α-spectral radius of G is the largest H-eigenvalue of αD(G)+(1−α)A(G), where D(G) and A(G) are the diagonal tensor of degrees and the adjacency tensor of G, respectively. We give upper bounds for the α-
Guo Haiyan, Zhou Bo
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

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

Maps preserving spectral radius, numerical radius, spectral norm

The Electronic Journal of Linear Algebra, 2007
It was shown by \textit{S. Clark}, \textit{C.K. Li}, and \textit{A. Rastogi} [Bull. Aust. Math. Soc. 77, No.~1, 49--72 (2008; Zbl 1147.15001)] that under some restrictions every (possibly nonlinear) map \(f:M_{m\times n}\to M_{m\times n}\) on rectangular matrices, which is multiplicative with respect to Schur (= entrywise) product, is of the form \(f ...
Li, Chi-Kwong, Poon, Edward, Rastogi, Ashwin   +2 more
openaire   +2 more sources

Cram\'er transform and t-entropy [PDF]

, 2013
t-entropy is the convex conjugate of the logarithm of the spectral radius of a weighted composition operator (WCO). Let $X$ be a nonnegative random variable.
Ostaszewska, Urszula, Zajkowski, Krzysztof   +1 more
core   +2 more sources