AbstractAn upper bound on the maximal entry in the principal eigenvector of a symmetric nonnegative matrix with zero diagonal entries is investigated in [S. Zhao, Y. Hong, On the bounds of maximal entries in the principal eigenvector of symmetric nonnegative matrix, Linear Algebra Appl. 340 (2002) 245–252]. We obtain a sharp upper bound on the maximal entry ymaxp in the principal eigenvector of symmetric nonnegative matrix in terms of order, the spectral radius, the largest and the smallest diagonal entries of that matrix. Our bound is applicable for any symmetric nonnegative matrix and the upper bound of Zhao and Hong (2002) for the maximal entry ymaxp follows as a special case. Moreover, we find an upper bound on maximal entry in the prin...
AbstractFor an arbitrary asymmetric nonnegative n × n matrix A we identify a pair of symmetric matri...
AbstractLet Lk0 denote the class of n × n Z-matrices A = tl − B with B ⩾ 0 and ϱk(B) ⩽ t < ϱk + 1(B)...
AbstractThe main aim of this note is to suggest a way of selecting the vector aT in a theorem of Bra...
AbstractAn upper bound on the maximal entry in the principal eigenvector of a symmetric nonnegative ...
AbstractLet G=(V,E) be a simple, connected and undirected graph with vertex set V(G) and edge set E(...
AbstractFor an undirected, connected graph it is well known that an eigenvector belonging to the pri...
AbstractLet G=(V,E) be a simple, connected and undirected graph with vertex set V(G) and edge set E(...
summary:We present a lower and an upper bound for the second smallest eigenvalue of Laplacian matric...
summary:We present a lower and an upper bound for the second smallest eigenvalue of Laplacian matric...
AbstractGernert conjectured that the sum of two largest eigenvalues of the adjacency matrix of any s...
AbstractLet A ϵ Mn. In terms of Perron roots and Perron vectors of two positive (or irreducible nonn...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
AbstractIf we normalize a symmetric n × n matrix with nonnegative entriesso that its largest entry i...
AbstractLet G be a simple connected graph with n vertices and m edges. Denote the degree of vertex v...
AbstractIn [Linear Algebra Appl. 177 (1992) 137] Smith proved that if H is a Hermitian semidefinite ...
AbstractFor an arbitrary asymmetric nonnegative n × n matrix A we identify a pair of symmetric matri...
AbstractLet Lk0 denote the class of n × n Z-matrices A = tl − B with B ⩾ 0 and ϱk(B) ⩽ t < ϱk + 1(B)...
AbstractThe main aim of this note is to suggest a way of selecting the vector aT in a theorem of Bra...
AbstractAn upper bound on the maximal entry in the principal eigenvector of a symmetric nonnegative ...
AbstractLet G=(V,E) be a simple, connected and undirected graph with vertex set V(G) and edge set E(...
AbstractFor an undirected, connected graph it is well known that an eigenvector belonging to the pri...
AbstractLet G=(V,E) be a simple, connected and undirected graph with vertex set V(G) and edge set E(...
summary:We present a lower and an upper bound for the second smallest eigenvalue of Laplacian matric...
summary:We present a lower and an upper bound for the second smallest eigenvalue of Laplacian matric...
AbstractGernert conjectured that the sum of two largest eigenvalues of the adjacency matrix of any s...
AbstractLet A ϵ Mn. In terms of Perron roots and Perron vectors of two positive (or irreducible nonn...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
AbstractIf we normalize a symmetric n × n matrix with nonnegative entriesso that its largest entry i...
AbstractLet G be a simple connected graph with n vertices and m edges. Denote the degree of vertex v...
AbstractIn [Linear Algebra Appl. 177 (1992) 137] Smith proved that if H is a Hermitian semidefinite ...
AbstractFor an arbitrary asymmetric nonnegative n × n matrix A we identify a pair of symmetric matri...
AbstractLet Lk0 denote the class of n × n Z-matrices A = tl − B with B ⩾ 0 and ϱk(B) ⩽ t < ϱk + 1(B)...
AbstractThe main aim of this note is to suggest a way of selecting the vector aT in a theorem of Bra...