The maximum degree of Nosal graphs

A graph $G$ with $m$ edges is a Nosal graph if its spectral radius $λ(G)$ exceeds $\sqrt m$. At the threshold $λ(G)=\sqrt m$, the star $K_{1,m}$ shows that one vertex can be incident with all $m$ edges. In contrast, Li, Liu and Zhang [J. Combin. Theory Ser. B 179 (2026)] proved that every Nosal graph $G$ with sufficiently many edges satisfies $Δ(G)\le\frac12m+m^{0.99}$, where the constant $\frac12$ is best possible. In this paper, we prove that every Nosal graph $G$ with spectral radius $λ$ satisfies $Δ(G)

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-10-29
DOI
https://doi.org/10.48550/arxiv.2610.40380
Primary Topic
Graph theory and applications
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

The maximum degree of Nosal graphs

Yongtao Li
arXiv (Cornell University)
Graph theory and applications
preprint

The maximum degree of Nosal graphs

Yongtao Li
preprint en

Abstract

A graph $G$ with $m$ edges is a Nosal graph if its spectral radius $λ(G)$ exceeds $\sqrt m$. At the threshold $λ(G)=\sqrt m$, the star $K_{1,m}$ shows that one vertex can be incident with all $m$ edges. In contrast, Li, Liu and Zhang [J. Combin. Theory Ser. B 179 (2026)] proved that every Nosal graph $G$ with sufficiently many edges satisfies $Δ(G)\le\frac12m+m^{0.99}$, where the constant $\frac12$ is best possible. In this paper, we prove that every Nosal graph $G$ with spectral radius $λ$ satisfies $Δ(G)

arXiv (Cornell University)
Graph theory and applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon
The maximum degree of Nosal graphs — Yongtao Li · arXiv (Cornell University) (2026) | TGRS Research Map | TGRS