Let be a -degenerate graph of order It is well-known that G\has no more edges than the join of a complete graph of order and an independent set of order In this note it is shown that is extremal for some spectral parameters of as well. More precisely, letting and denote the largest eigenvalues of the adjacency matrix and the signless Laplacian of a graph the inequalities hold, unless . The latter inequality is deduced from the following general bound, which improves some previous bounds on : If is a graph of order , with edges, with maximum degree and minimum degree then Equality holds if and only if is regular or has a component of order in which every vertex is of degree or and all other components are -regular.

生成讲解博客的中文版本

生成AI智能校验的中文版本