The high order spectral extrema of 2Kr-free graphs

Abstract

In this paper, we determine the graphs with maximum value of the sum number from k-clique spectral radius to (2r-1)-clique spectral radius among all 2Kr-free graphs on n vertices for r k and large n. We also determine the graphs with maximum 3-clique spectral radius among all 2K3-free graphs on n vertices. Our results are spectral versions of some results on generalized Tur\'an numbers.

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…