Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 6 Apr 2025 in math.CO | (2504.04389v1)

Abstract: For a graph $G$, let $S_2(G)$ be the sum of the first two largest signless Laplacian eigenvalues of $G$, and $f(G)=e(G)+3-S_2(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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.