Liu's modified degree-sequence conjecture for extremal nonregular graphs

From papers

Let G(n,Δ)\mathcal{G}(n,\Delta) be the set of connected nonregular graphs of order nn with maximum degree Δ\Delta that attain the maximum spectral radius. Suppose Δ3\Delta\geq 3 and GG(n,Δ)G\in\mathcal{G}(n,\Delta). For each fixed Δ\Delta and sufficiently large nn, write the degree sequence of GG as (Δ,,Δ,δ)(\Delta,\ldots,\Delta,\delta). Liu's modified conjecture. The exceptional degree is

δ={Δ1,if Δ and n are both odd,1,if Δ is odd and n is even,Δ2,if Δ is even.\delta=\begin{cases} \Delta-1,&\text{if }\Delta\text{ and }n\text{ are both odd},\\ 1,&\text{if }\Delta\text{ is odd and }n\text{ is even},\\ \Delta-2,&\text{if }\Delta\text{ is even}. \end{cases}

This is a modification of the Liu–Li conjecture after the cases Δ=3,4\Delta=3,4 were confirmed. The source presents the modified statement as a conjecture; its general resolution is not supplied.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Zejun Huang, Jiahui Liu and Chenxi Yang, “Nonregular graphs with a given maximum degree attaining maximum spectral radius”, arXiv:2411.17371 (2024).

Solutions 0

No solutions have been posted yet.