vol15_pp260-268. 140KB Jun 04 2011 12:05:56 AM
Teks penuh
Garis besar
Dokumen terkait
Discrete p -Laplacian, Largest eigenvalue, Eigenvector, Tree, Degree
In this paper, left derivations and Jordan left derivations in full and upper triangular matrix rings over unital associative rings are characterized..
Block matrix, Determinant, Quaternion matrices, Universal factorization, Involu- tory matrices, Idempotent matrices.. AMS
A square complex or real matrix A is called an H-matrix if there exists a square positive diagonal matrix X such that AX is strictly diagonally dominant (SDD)[5].. We denote by ρ (
Limit points for the positive eigenvalues of the normalized Laplacian matrix of a graph are considered.Specifically, it is shown that the set of limit points for the j -th smallest
The weak interlacing theorem enables us to bound the average number of leaves in a dense expander graph.. In this paper we proved a weak interlacing theorem for the
Based on this symmetric version, we give in section 3 a new criterion (Theorem 3.1) for the existence of a symmetric nonnegative matrix with prescribed spectrum, together with
Circulant matrix, A -Factor circulant matrices, Block Vandermonde and Fourier matrices, Rotation and hyperbolic matrices, Generalized Euler formula matrices, Periodic solutions..
