arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2209.12367math.CO
收藏

给定最大度的非正则图的谱半径的最大值

Maxima of spectral radius of irregular graphs with given maximum degree

Jie Xue, Ruifang Liu

摘要:

设$λ^{*}$是连通不规则图在$Δ$最大度的$n$上的最大谱半径. Liu,Shen and Wang(2007)证明了描述不规则图最大谱半径渐近行为的$\lim_{n\rightarrow \infty}(n^{2}(Δ-λ^{*}))/(Δ-1)=π^{2},$。围绕这一猜想,我们考虑了连通次立方二部图的最大谱半径。确定了唯一的具有最大谱半径的连通次立方二部图。设$G$是一个具有谱半径$λ_{1}(G)$的$k$ -连通非正则图,我们给出了$Δ-λ_{1}(G)$的一个下界.此外,如果$H$是$k$ -连通$Δ$ -正则图的真子图,还得到了$Δ-λ_{1}(H)$的一个下界.这些界改进了以前的一些结果。

英文摘要:

Let $λ^{*}$ be the maximum spectral radius of connected irregular graphs on $n$ vertices with maximum degree $Δ$. Liu, Shen and Wang (2007) conjectured that $\lim_{n\rightarrow \infty}(n^{2}(Δ-λ^{*}))/(Δ-1)=π^{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 $G$ be a $k$-connected irregular graph with spectral radius $λ_{1}(G)$, we present a lower bound for $Δ-λ_{1}(G)$. Moreover, if $H$ is a proper subgraph of a $k$-connected $Δ$-regular graph, a lower bound for $Δ-λ_{1}(H)$ is also obtained. These bounds improve some previous results.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑