科研之友
微信
新浪微博
Facebook
分享链接
摘要
This mostly expository note surveys and recovers a lower bound for the number of distinct eigenvalues of real symmetric matrices associated with a graph. The relation is established with the length of some paths of the underlying graph, using an improvement of an inequality involving the multiplicities of the eigenvalues. An interesting use of that number is observed. Some applications of the results to particular classes of graphs are considered.
- 出版日期2010-10
