Extremal graphs for the sum of the first two largest signless Laplacian eigenvalues

Abstract

For a graph G, let S2(G) be the sum of the first two largest signless Laplacian eigenvalues of G, and f(G)=e(G)+3-S2(G). Very recently, Zhou, He and Shan proved that K+1,n-1 (the star graph with an additional edge) is the unique graph with minimum value of f(G) among graphs on n vertices. In this paper, we prove that K+1,e(G)-1 is the unique graph with minimum value of f(G) among graphs with e(G) edges.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…