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
AbstractGernert conjectured that the sum of two largest eigenvalues of the adjacency matrix of any s...
The spectral properties of nonnegative matrices have intrigued pure and applied mathematicians alike...
The spectra of signed matrices have played a fundamental role in social sciences, graph theory, and ...
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...
AbstractThe largest eigenvalue of the adjacency matrix of a graph has received considerable attentio...
AbstractWe prove that if B is an essentially nonnegative symmetric matrix with minimum eigenvalue m(...
AbstractWe prove that if B is an essentially nonnegative symmetric matrix with minimum eigenvalue m(...
AbstractLet G a simple undirected graph with n ⩾ 2 vertices and let α0(G) ⩾ …, αn−1(G) be the eigenv...
The study of eigenvalue list multiplicities of matrices with certain graphs has appeared in volumes ...
AbstractThe largest eigenvalue of the adjacency matrix of a graph has received considerable attentio...
AbstractThis paper is concerned with the relationship between geometric properties of a graph and th...
The largest eigenvalue of the adjacency matrix of a graph has received considerable attention in the...
AbstractFor an arbitrary asymmetric nonnegative n × n matrix A we identify a pair of symmetric matri...
AbstractGiven a matrix A=[aij], define ‖A‖=[‖aij‖]. Let ⦀ · ⦀2 denote the spectral norm. We show tha...
AbstractGernert conjectured that the sum of two largest eigenvalues of the adjacency matrix of any s...
The spectral properties of nonnegative matrices have intrigued pure and applied mathematicians alike...
The spectra of signed matrices have played a fundamental role in social sciences, graph theory, and ...
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...
AbstractThe largest eigenvalue of the adjacency matrix of a graph has received considerable attentio...
AbstractWe prove that if B is an essentially nonnegative symmetric matrix with minimum eigenvalue m(...
AbstractWe prove that if B is an essentially nonnegative symmetric matrix with minimum eigenvalue m(...
AbstractLet G a simple undirected graph with n ⩾ 2 vertices and let α0(G) ⩾ …, αn−1(G) be the eigenv...
The study of eigenvalue list multiplicities of matrices with certain graphs has appeared in volumes ...
AbstractThe largest eigenvalue of the adjacency matrix of a graph has received considerable attentio...
AbstractThis paper is concerned with the relationship between geometric properties of a graph and th...
The largest eigenvalue of the adjacency matrix of a graph has received considerable attention in the...
AbstractFor an arbitrary asymmetric nonnegative n × n matrix A we identify a pair of symmetric matri...
AbstractGiven a matrix A=[aij], define ‖A‖=[‖aij‖]. Let ⦀ · ⦀2 denote the spectral norm. We show tha...
AbstractGernert conjectured that the sum of two largest eigenvalues of the adjacency matrix of any s...
The spectral properties of nonnegative matrices have intrigued pure and applied mathematicians alike...
The spectra of signed matrices have played a fundamental role in social sciences, graph theory, and ...