论文信息 - An explicit upper bound on disparity for trees of a given diameter

An explicit upper bound on disparity for trees of a given diameter

It is known that the minimum number of distinct eigenvalues c ( T ) of a symmetric matrix whose graph is a given tree T is at least the diameter d ( T ) of that tree. However, the disparity c ( T )...

Charles R. Johnson | Isaac Cinzori | Hannah Lang

[1] Charles R. Johnson,et al. Branch duplication for the construction of multiple eigenvalues in an Hermitian matrix whose graph is a tree , 2008 .

[2] Shaun M. Fallat,et al. Generalizations of the Strong Arnold Property and the Minimum Number of Distinct Eigenvalues of a Graph , 2015, Electron. J. Comb..

[3] Shaun M. Fallat,et al. Minimum number of distinct eigenvalues of graphs , 2013, 1304.1205.

[4] Carlos M. Saiago,et al. Diameter minimal trees , 2016 .