Nonregular graphs with a given maximum degree attaining maximum spectral radius
Abstract
Let G be a connected nonregular graphs of order n with maximum degree that attains the maximum spectral radius. Liu and Li (2008) proposed a conjecture stating that G has a degree sequence (,…,,δ) with δ<. For =3 and =4, Liu (2024) confirmed this conjecture by characterizing the structure of such graphs. Liu also proposed a modified version of the conjecture for fixed and sufficiently large n, stating that the above δ=-1 if and n are both odd, δ=1 if is odd and n is even, and δ=-2 if is even. For the cases where =n-2 with n 5, and =n-3 with n 59, we fully characterize the structure of G.
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.