English

Maxima of spectral radius of irregular graphs with given maximum degree

Combinatorics 2022-09-27 v1

Abstract

Let λ\lambda^{*} be the maximum spectral radius of connected irregular graphs on nn vertices with maximum degree Δ\Delta. Liu, Shen and Wang (2007) conjectured that limn(n2(Δλ))/(Δ1)=π2,\lim_{n\rightarrow \infty}(n^{2}(\Delta-\lambda^{*}))/(\Delta-1)=\pi^{2}, which describes the asymptotic behavior for the maximum spectral radius of irregular graphs. Focusing on this conjecture, we consider the maximum spectral radius of connected subcubic bipartite graphs. The unique connected subcubic bipartite graph with the maximum spectral radius is determined. Let GG be a kk-connected irregular graph with spectral radius λ1(G)\lambda_{1}(G), we present a lower bound for Δλ1(G)\Delta-\lambda_{1}(G). Moreover, if HH is a proper subgraph of a kk-connected Δ\Delta-regular graph, a lower bound for Δλ1(H)\Delta-\lambda_{1}(H) is also obtained. These bounds improve some previous results.

Keywords

Cite

@article{arxiv.2209.12367,
  title  = {Maxima of spectral radius of irregular graphs with given maximum degree},
  author = {Jie Xue and Ruifang Liu},
  journal= {arXiv preprint arXiv:2209.12367},
  year   = {2022}
}

Comments

15 pages, 1 figures