AbstractIf we normalize a symmetric n × n matrix with nonnegative entriesso that its largest entry is 1, then its spectrum is bounded below by −n2. The lower bound is achieved in all even dimensions for (and only for) adjacency matrices of complete bipartite graphs with equal parts
The spectral properties of nonnegative matrices have intrigued pure and applied mathematicians alike...
AbstractLet σ=(λ1,…,λn) be the spectrum of a nonnegative symmetric matrix A with the Perron eigenval...
It is well known that a graph is bipartite if and only if the spectrum of its adjacency matrix is sy...
AbstractIf we normalize a symmetric n × n matrix with nonnegative entriesso that its largest entry i...
AbstractFor an arbitrary asymmetric nonnegative n × n matrix A we identify a pair of symmetric matri...
The largest eigenvalue of the adjacency matrix of a graph has received considerable attention in the...
AbstractThe largest eigenvalue of the adjacency matrix of a graph has received considerable attentio...
AbstractWe give a lower bound for the second smallest eigenvalue of Laplacian matrices in terms of t...
AbstractAn upper bound on the maximal entry in the principal eigenvector of a symmetric nonnegative ...
AbstractSome new sufficient conditions are found for n real numbers to be the spectrum of some n × n...
AbstractWe prove that if B is an essentially nonnegative symmetric matrix with minimum eigenvalue m(...
AbstractFor an arbitrary asymmetric nonnegative n × n matrix A we identify a pair of symmetric matri...
AbstractWe consider lower bounds for the largest eigenvalue of a symmetric matrix. In particular we ...
The spectral properties of nonnegative matrices have intrigued pure and applied mathematicians alike...
A conference matrix of order $n$ is an $n\times n$ matrix $C$ with diagonal entries $0$ and off-diag...
The spectral properties of nonnegative matrices have intrigued pure and applied mathematicians alike...
AbstractLet σ=(λ1,…,λn) be the spectrum of a nonnegative symmetric matrix A with the Perron eigenval...
It is well known that a graph is bipartite if and only if the spectrum of its adjacency matrix is sy...
AbstractIf we normalize a symmetric n × n matrix with nonnegative entriesso that its largest entry i...
AbstractFor an arbitrary asymmetric nonnegative n × n matrix A we identify a pair of symmetric matri...
The largest eigenvalue of the adjacency matrix of a graph has received considerable attention in the...
AbstractThe largest eigenvalue of the adjacency matrix of a graph has received considerable attentio...
AbstractWe give a lower bound for the second smallest eigenvalue of Laplacian matrices in terms of t...
AbstractAn upper bound on the maximal entry in the principal eigenvector of a symmetric nonnegative ...
AbstractSome new sufficient conditions are found for n real numbers to be the spectrum of some n × n...
AbstractWe prove that if B is an essentially nonnegative symmetric matrix with minimum eigenvalue m(...
AbstractFor an arbitrary asymmetric nonnegative n × n matrix A we identify a pair of symmetric matri...
AbstractWe consider lower bounds for the largest eigenvalue of a symmetric matrix. In particular we ...
The spectral properties of nonnegative matrices have intrigued pure and applied mathematicians alike...
A conference matrix of order $n$ is an $n\times n$ matrix $C$ with diagonal entries $0$ and off-diag...
The spectral properties of nonnegative matrices have intrigued pure and applied mathematicians alike...
AbstractLet σ=(λ1,…,λn) be the spectrum of a nonnegative symmetric matrix A with the Perron eigenval...
It is well known that a graph is bipartite if and only if the spectrum of its adjacency matrix is sy...
DOI
Add to ORKG