Results 61 to 70 of about 477,790 (171)
The First Zagreb Index, the Laplacian Spectral Radius, and Some Hamiltonian Properties of Graphs
The first Zagreb index of a graph G is defined as the sum of the squares of the degrees of all the vertices in G. The Laplacian spectral radius of a graph G is defined as the largest eigenvalue of the Laplacian matrix of the graph G.
Rao Li
doaj +1 more source
On the maximum spectral radius of multipartite graphs
Let be an integer. A graph is called r – partite if V admits a partition into r parts such that every edge has its ends in different parts. All of the r – partite graphs with given integer r consist of the class of multipartite graphs.
Jian Wu, Haixia Zhao
doaj +1 more source
The Ratios Between The Spectral Norm, The Numerical Radius And The Spectral Radius
{"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.
openaire +4 more sources
Linear Maps Preserving the Spectral Radius
Let \(X\) be a complex Banach space and \({\mathcal B}(X)\) the algebra of all bounded linear operators on \(X\). For \(A\in{\mathcal B}(X)\) let \(\sigma(A)\) and \(r(A)\) denote the spectrum and the spectral radius of \(A\). It has been shown by \textit{A. A. Jafarian} and \textit{A. R. Sourour} [J. Funct. Anal.
Brešar, Matej, Šemrl, Peter
openaire +1 more source
Comparison Theorems for Single and Double Splittings of Matrices
Some comparison theorems for the spectral radius of double splittings of different matrices under suitable conditions are presented, which are superior to the corresponding results in the recent paper by Miao and Zheng (2009).
Cui-Xia Li, Qun-Fa Cui, Shi-Liang Wu
doaj +1 more source
Bounds for the Z-eigenpair of general nonnegative tensors
In this paper, we consider the Z-eigenpair of a tensor. A lower bound and an upper bound for the Z-spectral radius of a weakly symmetric nonnegative irreducible tensor are presented.
Liu Qilong, Li Yaotang
doaj +1 more source
Extremal Unicyclic Graphs With Minimal Distance Spectral Radius
The distance spectral radius ρ(G) of a graph G is the largest eigenvalue of the distance matrix D(G). Let U (n,m) be the class of unicyclic graphs of order n with given matching number m (m ≠ 3).
Lu Hongyan, Luo Jing, Zhu Zhongxun
doaj +1 more source
Why the Spectral Radius? An intuition-building introduction to the basic reproduction number. [PDF]
Brouwer AF.
europepmc +1 more source
The Distance Laplacian Spectral Radius of Clique Trees
The distance Laplacian matrix of a connected graph G is defined as ℒG=TrG−DG, where DG is the distance matrix of G and TrG is the diagonal matrix of vertex transmissions of G.
Xiaoling Zhang, Jiajia Zhou
doaj +1 more source
Spectral radius algebras and $C_0$ contractions [PDF]
Let \(\mathcal H\) be a complex, separable Hilbert space and let \(\mathcal L(\mathcal H)\) denote the algebra of all bounded linear operators on \(\mathcal H\). For an operator \(A\in\mathcal L(\mathcal H)\) with spectral radius \(r\) and for a positive integer \(m\), define \(d_m=m/(1+rm)\) and \(R_m=(\sum_{n=0}^\infty d_m^{2n}A^{*n}A^n)^{1/2}\). The
openaire +2 more sources

