English

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

Combinatorics 2025-04-08 v1

Abstract

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

Keywords

Cite

@article{arxiv.2504.04389,
  title  = {Extremal graphs for the sum of the first two largest signless Laplacian eigenvalues},
  author = {Zi-Ming Zhou and Zhi-Bin Du and Chang-Xiang He},
  journal= {arXiv preprint arXiv:2504.04389},
  year   = {2025}
}

Comments

8 pages, 3 figures