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

游走的局部Turán不等式与谱半径

Local Turán inequalities for walks and the spectral radius

School of Mathematical Sciences, Shanghai Jiao Tong University(上海交通大学数学科学学院);School of Mathematical Sciences, East China Normal University(华东师范大学数学科学学院)

Feng Liu, Shuang Sun, Yan Wang, Qi Wu

AI总结:

本文证明了关于游走的Nikiforov谱Turán不等式的顶点局部和边局部加强形式,并刻画了极图。

摘要:

Nikiforov著名的关于游走的谱Turán不等式指出,对于每个团数$ω(G)$的图$G$,有$λ^r(G)\le w_r(G)(1-1/ω(G))$,其中$λ(G)$是$G$的邻接矩阵的最大特征值,$w_r(G)$是$G$中具有$r$个顶点的游走数。对于$r=1$,这是Wilf不等式;对于$r=2$,它给出了Nikiforov的谱Turán定理。最近,Liu和Ning证明了这两个不等式的局部版本,加强了Wilf不等式和Nikiforov的谱Turán定理。自然要问,Nikiforov关于游走的谱Turán不等式是否也有局部加强。受此问题启发,Kannan、Kumar和Pragada猜想顶点局部界$λ^r(G)\le \sum_{v\in V(G)} w_r(v)(1-1/c_G(v))$,其中$w_r(v)$表示从$v$出发的具有$r$个顶点的游走数,$c_G(v)$是包含$v$的团的最大阶。这个猜想很重要,因为它给出了Nikiforov关于游走的谱Turán不等式最自然的局部形式。在本文中,我们证实了这个猜想。更精确地,对于$r\ge 2$,我们证明了更强的边局部不等式$$λ^r(G) \le \sum_{uv\in E(G)} \frac{c_G(uv)-1}{c_G(uv)} \bigl(w_{r-1}(u)+w_{r-1}(v)\bigr),$$其中$c_G(uv)$是包含边$uv$的团的最大阶。我们的结果蕴含了Nikiforov关于游走的谱Turán不等式,并统一了Liu和Ning的几个局部谱极值结果。我们还确定了边局部和顶点局部不等式的所有极图。主要的新工具是一个马尔可夫链估计,其转移矩阵由$A(G)$的Perron向量构造;该估计通过任意长度的游走携带局部边系数。

英文摘要:

Nikiforov's well-known spectral Turán inequality for walks states that, for every graph $G$ with clique number $ω(G)$, $λ^r(G)\le w_r(G)(1-1/ω(G))$, where $λ(G)$ is the largest eigenvalue of the adjacency matrix of $G$, and $w_r(G)$ is the number of walks with $r$ vertices in $G$. For $r=1$, this is Wilf's inequality; for $r=2$, it gives Nikiforov's spectral Turán theorem. Recently, Liu and Ning proved local versions of these two inequalities, strengthening both Wilf's inequality and Nikiforov's spectral Turán theorem. It is natural to ask whether Nikiforov's spectral Turán inequality for walks also admits a local strengthening. Motivated by this question, Kannan, Kumar, and Pragada conjectured the vertex-local bound $λ^r(G)\le \sum_{v\in V(G)} w_r(v)(1-1/c_G(v))$, where $w_r(v)$ denotes the number of walks with $r$ vertices starting at $v$, and $c_G(v)$ is the maximum order of a clique containing $v$. This conjecture is important because it gives the most natural local form of Nikiforov's spectral Turán inequality for walks. In this paper, we confirm this conjecture. More precisely, for $r\ge 2$, we prove the stronger edge-local inequality $$λ^r(G) \le \sum_{uv\in E(G)} \frac{c_G(uv)-1}{c_G(uv)} \bigl(w_{r-1}(u)+w_{r-1}(v)\bigr),$$ where $c_G(uv)$ is the maximum order of a clique containing the edge $uv$. Our result implies Nikiforov's spectral Turán inequality for walks and unifies several local spectral extremal results of Liu and Ning. We also determine all extremal graphs for both the edge-local and vertex-local inequalities. The main new ingredient is a Markov-chain estimate whose transition matrix is constructed from a Perron vector of $A(G)$; this estimate carries the local edge coefficient through walks of arbitrary length.

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

↑