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

关于距离谱极值问题的一个猜想

On a conjecture of distance spectral extremal problems

Gansu Center for Applied Mathematics, Lanzhou University(兰州大学);School of Mathematics and Statistics, Minnan Normal University(闽南师范大学数学与统计学院);Yau Mathematical Sciences Center, Tsinghua University(清华大学丘成桐数学科学中心)

Hongzhang Chen, Jianxi Li, Yongtao Li

AI总结:

本文研究了具有给定边数m的连通图中距离谱半径最小的图的特征,通过创新的矩阵分析方法解决了Lin和Zhou的猜想,并提供了统一的证明。

摘要:

Brualdi和Hoffman提出确定具有给定大小m的所有图中最大邻接谱半径的图的问题。早期工作由Friedland和Stanley处理了一些特定情况。该问题后来由Rowlinson完全解决,最近由Cheng和Weng重新审视。Graham和Pollak以及Graham和Lovász对距离矩阵进行了开创性工作。连通图G的距离谱半径ρ(G)是其距离矩阵的最大特征值。在本文中,我们完全解决了具有大小m的连通图中最小距离谱半径的图的特征问题。令G(m)为具有m条边的连通图类。对于每个m≥3,令n为满足C(n-1,2)<m≤C(n,2)的唯一整数,并将m=C(n-1,2)+s,其中1≤s≤n-1。最近,Lin和Zhou[Adv. in Appl. Math. 173 (2026)]研究了在范围s≥max{ (n-6)/2, 1}中G(m)中最小化ρ(G)的图。然而,在剩余范围1≤s≤(n-7)/2中,该问题更加困难,他们猜想唯一的最小化器是补集的平衡不相交路径的并集。使用新颖的矩阵分析方法,我们解决了这个猜想,并且提供了整个范围1≤s≤n-1的新统一证明。我们证明的关键成分包括创新的距离谱半径比较原理,路径和循环上Φ函数的增量分析,平衡路径长度的论证,以及通过Neumann级数的行走计数技术。

英文摘要:

Brualdi and Hoffman proposed a well-known problem of determining the graph with maximum adjacency spectral radius among all graphs with given size $m$. Early work by Friedland and Stanley addressed some specific cases. This problem was later completely solved by Rowlinson and recently revisited by Cheng and Weng. Pioneering work on the distance matrix was carried out by Graham and Pollak, as well as by Graham and Lovász. The distance spectral radius $ρ(G)$ of a connected graph $G$ is the largest eigenvalue of its distance matrix. In this paper, we completely solve the problem of characterizing the connected graph with minimum distance spectral radius among all graphs with size $m$. Let $\mathcal{G}(m)$ be the class of connected graphs with $m$ edges. For every $m \ge 3$, let $n$ be the unique integer satisfying $\binom{n-1}{2} < m \le \binom{n}{2}$, and we write $m = \binom{n-1}{2} + s$ with $1 \le s \le n-1$. Recently, Lin and Zhou [Adv. in Appl. Math. 173 (2026)] investigated the graph in $\mathcal{G}(m)$ that minimizes $ρ(G)$ in the range $s \ge \max\{ \frac{n-6}{2}, 1\}$. However, the problem is much more difficult in the remaining range $1 \le s \le \frac{n-7}{2}$, and they conjectured that the unique minimizer is $\overline{P_{n,s+1}}$, the complement of a balanced disjoint union of paths. Using novel matrix analysis, we solve this conjecture in the affirmative. Moreover, we provide a new unified proof for the entire range $1 \le s \le n-1$. The key ingredients in our proof argument include an innovative comparison principle for the distance spectral radius, an increment analysis of $Φ$-functions on paths and cycles, an argument for balancing path lengths, and a walk enumeration technique via the Neumann series.

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

↑