Results 11 to 20 of about 1,235,690 (292)
Spectral Radius and Hamiltonicity of Graphs [PDF]
Discussiones Mathematicae Graph Theory, 2019 In this paper, we study the Hamiltonicity of graphs with large minimum degree. Firstly, we present some conditions for a simple graph to be Hamilton-connected and traceable from every vertex in terms of the spectral radius of the graph or its complement,
Yu Guidong +3 more
doaj +5 more sources
A formula for the inner spectral radius [PDF]
International Journal of Mathematics and Mathematical Sciences, 2004 This note presents an asymptotic formula for the minimum of the moduli of the elements in the spectrum of a bounded linear operator acting on Banach space X.
S. Mahmoud Manjegani
doaj +7 more sources
On the α-Spectral Radius of Uniform Hypergraphs [PDF]
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 +6 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 +4 more
doaj +2 more sources
Maps preserving spectral radius, numerical radius, spectral norm [PDF]
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 +2 more
openaire +3 more sources
Optimizing the Spectral Radius [PDF]
SIAM Journal on Matrix Analysis and Applications, 2013 We suggest a new approach to finding the maximal and the minimal spectral radii of linear operators from a given compact family of operators, which share a common invariant cone (e.g., family of no...
Yurii E. Nesterov, Vladimir Protasov
openaire +2 more sources
A generalization of spectral radius, numerical radius, and spectral norm
Linear Algebra and its Applications, 1987 The author defines three quantities, \(\rho\) (A), r(A), and \(\| A\|\), as scalar functions of a matrix A. These are \(\ell_ p\) norms of tuples formed respectively from the eigenvalues of A, the diagonal of a unitary similarity of A (that is, \(UAU^*)\), and the diagonal of a matrix unitarily equivalent to A (that is, UAV), where U, V are to be ...
Li, Chi-Kwong
openaire +3 more sources
The Ratios Between The Spectral Norm, The Numerical Radius And The Spectral Radius
World Academy of Science, Engineering and Technology, 2010 {"references": ["B. Beckermann, S. A. Goreinov, and E. E. Tyrtyshnikov. Some Remarks\non the Elman Estimate for GMRES. SIAM J. Matrix Anal. Appl.,\n27(3):772-778, 2006.", "L. Caston, M. Savova, I. Spitkovsky, and N. Zobin. On eigenvalues\nand boundary curvature of the numerical range. Linear Algebra Appl.,\n322(1-3):129-140, 2001.", "M. Eiermann and O.
Kui Du
openaire +6 more sources
A note on distance spectral radius of trees
Special Matrices, 2017 The distance spectral radius of a connected graph is the largest eigenvalue of its distance matrix. We determine the unique non-starlike non-caterpillar tree with maximal distance spectral radius.
Wang Yanna +3 more
doaj +2 more sources
The spectral radius and the distance spectral radius of complements of block graphs [PDF]
In this paper, we determine the graphs whose spectral radius and distance spectral radius attain maximum and minimum among all complements of clique trees. Furthermore, we also determine the graphs whose spectral radius and distance spectral radius attain minimum and maximum among all complements of block graphs, respectively.
Chen, Xu +3 more
openaire +3 more sources