Maxima of the Q-index: degenerate graphs

Abstract

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

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…