English

Nonregular graphs with a given maximum degree attaining maximum spectral radius

Combinatorics 2024-11-27 v1

Abstract

Let GG be a connected nonregular graphs of order nn with maximum degree Δ\Delta that attains the maximum spectral radius. Liu and Li (2008) proposed a conjecture stating that GG has a degree sequence (Δ,,Δ,δ)(\Delta,\ldots,\Delta,\delta) with δ<Δ\delta<\Delta. For Δ=3\Delta=3 and Δ=4\Delta=4, Liu (2024) confirmed this conjecture by characterizing the structure of such graphs. Liu also proposed a modified version of the conjecture for fixed Δ\Delta and sufficiently large nn, stating that the above δ=Δ1\delta=\Delta-1 if Δ\Delta and nn are both odd, δ=1\delta=1 if Δ\Delta is odd and nn is even, and δ=Δ2\delta=\Delta-2 if Δ\Delta is even. For the cases where Δ=n2\Delta=n-2 with n5n\ge 5, and Δ=n3\Delta=n-3 with n59n\ge 59, we fully characterize the structure of GG.

Keywords

Cite

@article{arxiv.2411.17371,
  title  = {Nonregular graphs with a given maximum degree attaining maximum spectral radius},
  author = {Zejun Huang and Jiahui Liu and Chenxi Yang},
  journal= {arXiv preprint arXiv:2411.17371},
  year   = {2024}
}
R2 v1 2026-06-28T20:13:05.296Z