论文信息 - Estimation of the maximum multiplicity of an eigenvalue in terms of the vertex degrees of the graph of a matrix

Estimation of the maximum multiplicity of an eigenvalue in terms of the vertex degrees of the graph of a matrix

The maximum multiplicity among eigenvaluesof matriceswith a given graph cannot generally be expressed in terms of the degrees of the vertices (even when the graph is a tree). Given are best possible lower and upper bounds, and characterization of the cases of equality in these bounds. A by-product is a sequential algorithm to calculate the exact maximum multiplicity by simple counting.

Charles R. Johnson | Carlos M. Saiago

[1] Charles R. Johnson,et al. Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[2] Charles R. Johnson,et al. The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree , 1999 .

[3] Charles R. Johnson,et al. ON THE MINIMUM NUMBER OF DISTINCT EIGENVALUES FOR A SYMMETRIC MATRIX WHOSE GRAPH IS A GIVEN TREE , 2002 .