Results 11 to 20 of about 479,522 (272)
Spectral radius of S-essential spectra
Математичні Студії, 2020 In this paper, we study the spectral radius of some S-essential spectra of a bounded linear operator defined on a Banach space. More precisely, via the concept of measure of noncompactness,we show that for any two bounded linear operators $T$ and $S ...
C. Belabbaci
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
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
Some spectral sufficient conditions for a graph being pancyclic
AIMS Mathematics, 2020 Let $G(V,E)$ be a simple connected graph of order $n$. A graph of order $n$ is called pancyclic if it contains all the cycles $C_k$ for $k\in \{3,4,\cdot\cdot\cdot,n\}$. In this paper, some new spectral sufficient conditions for the graph to be pancyclic
Huan Xu +5 more
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 +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 +4 more
doaj +1 more source
A Sharp upper bound for the spectral radius of a nonnegative matrix and applications [PDF]
, 2016 In this paper, we obtain a sharp upper bound for the spectral radius of a nonnegative matrix. This result is used to present upper bounds for the adjacency spectral radius, the Laplacian spectral radius, the signless Laplacian spectral radius, the ...
Shu, Yujie, You, Lihua, Zhang, Xiao-Dong
core +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 +1 more
core +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 +2 more
doaj +1 more source