Bounds on graph eigenvalues II
classification
🧮 math.CO
keywords
grapheigenvaluesorderboundscliquesgivengraphsimproved
read the original abstract
Some recent results on graph eigenvalues are improved. In particular, among all graphs of given order with no cliques of order $(r+1)$ the $r$-partite Turan graph has maximal spectral radius.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.