solidot新版网站常见问题,请点击这里查看。

A Descent on Simple Graphs -- from Complete to Cycle -- and Algebraic Properties of Their Spectra. (arXiv:1711.05500v1 [math.CO])

来源于:arXiv
We investigate a descent on simple graphs, starting with the complete graph on $n$ vertices and ending up with the cycle graph by removing one edge after another. We obtain quantitative results showing that graphs with small diameter must have some eigenvalues of large algebraic degree. 查看全文>>