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...
AbstractWe prove that if B is an essentially nonnegative symmetric matrix with minimum eigenvalue m(...
AbstractGernert conjectured that the sum of two largest eigenvalues of the adjacency matrix of any s...
AbstractIf we normalize a symmetric n × n matrix with nonnegative entriesso that its largest entry i...
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(...
AbstractFor an undirected, connected graph it is well known that an eigenvector belonging to the pri...
AbstractIf we normalize a symmetric n × n matrix with nonnegative entriesso that its largest entry i...
summary:We present a lower and an upper bound for the second smallest eigenvalue of Laplacian matric...
AbstractFor an arbitrary asymmetric nonnegative n × n matrix A we identify a pair of symmetric matri...
AbstractLet G be a graph on vertex set V=v1,v2,…,vn. Let di be the degree of vi, let Ni be the set o...
AbstractWe consider lower bounds for the largest eigenvalue of a symmetric matrix. In particular we ...
AbstractLet G be a simple graph with n vertices. The matrix L(G)=D(G)−A(G) is called the Laplacian o...
In this paper, we propose an improved power algorithm for finding maximal eigenvalues. Without any p...
AbstractWe prove that if B is an essentially nonnegative symmetric matrix with minimum eigenvalue m(...
AbstractGernert conjectured that the sum of two largest eigenvalues of the adjacency matrix of any s...
AbstractIf we normalize a symmetric n × n matrix with nonnegative entriesso that its largest entry i...
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(...
AbstractFor an undirected, connected graph it is well known that an eigenvector belonging to the pri...
AbstractIf we normalize a symmetric n × n matrix with nonnegative entriesso that its largest entry i...
summary:We present a lower and an upper bound for the second smallest eigenvalue of Laplacian matric...
AbstractFor an arbitrary asymmetric nonnegative n × n matrix A we identify a pair of symmetric matri...
AbstractLet G be a graph on vertex set V=v1,v2,…,vn. Let di be the degree of vi, let Ni be the set o...
AbstractWe consider lower bounds for the largest eigenvalue of a symmetric matrix. In particular we ...
AbstractLet G be a simple graph with n vertices. The matrix L(G)=D(G)−A(G) is called the Laplacian o...
In this paper, we propose an improved power algorithm for finding maximal eigenvalues. Without any p...
AbstractWe prove that if B is an essentially nonnegative symmetric matrix with minimum eigenvalue m(...
AbstractGernert conjectured that the sum of two largest eigenvalues of the adjacency matrix of any s...
AbstractIf we normalize a symmetric n × n matrix with nonnegative entriesso that its largest entry i...