vol22_pp267-276. 146KB Jun 04 2011 12:06:12 AM
Teks penuh
Gambar
Garis besar
Dokumen terkait
The sign-real and the sign-complex spectral radius, also called the generalized spec- tral radius, proved to be an interesting generalization of the classical Perron-Frobenius
The spectral radius of connected non-regular graphs is considered.. This improves the recent results
Yamazaki that an upper and a lower bounds for the numerical radius of a geometrically weighted shift operator can be obtained from the numerical range of the Aluthge transformation
Furthermore, we show that the largest maximum eigenvalue in such classes of trees is strictly monotone with respect to some partial ordering of degree sequences.. Thus, we extend
Moreover, the minimum (resp. maximum) number of edges for all (connected) graphs with pendent vertices and nullity η are determined, and the extremal graphs are characterized..
For normal matrices in WPFn and those in WPFn for which the spectral radius is simple, we present approximating matrices that satisfy the strong P-F property and are polynomials
In this paper, we will establish the above conjecture (Theorem 2.3) and also characterize all sign patterns that require eventual nonnegativity (Theorem 2.6) in terms of
We prove Zhan’s conjecture, and a related inequality for positive semidefinite matrices, using standard facts about principal submatrices, Kronecker products, and the spectral
