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

关于无奇轮图谱半径的更多结果

More results on the spectral radius of graphs with no odd wheels

Wenqian Zhang

AI总结:

本文解决了无奇轮图谱半径极值问题中遗留的 k=4,5 情形,并进一步刻画了 k 为偶数且 n≡2(mod 4) 时的极值图,从而对任意 k≥2 和充分大的 n 完全确定了 SPEX(n,W_{2k+1})。

摘要:

对于图 $G$,其谱半径 $λ_{1}(G)$ 是 $G$ 的邻接矩阵的最大特征值。奇轮 $W_{2k+1}$(其中 $k\geq2$)是在一个 $2k$ 阶圈上添加一个新顶点,并将该新顶点与圈上所有顶点相连所得到的图。令 ${\rm SPEX}(n,W_{2k+1})$ 表示所有 $n$ 阶无 $W_{2k+1}$ 子图的图中具有最大谱半径的图集合。最近,Cioabă、Desai 和 Tait \cite{CDT2} 对充分大的 $n$ 刻画了 ${\rm SPEX}(n,W_{2k+1})$ 中的图,其中 $k\geq2$ 且 $k\neq4,5$,但他们将 $k=4,5$ 的情形留作未解决问题。本文解决了这一问题。此外,当 $k\geq4$ 为偶数且 $n\equiv2~({\rm mod}~4)$ 充分大时,我们完全刻画了 ${\rm SPEX}(n,W_{2k+1})$ 中的图。由此,对任意 $k\geq2$ 和充分大的 $n$,${\rm SPEX}(n,W_{2k+1})$ 中的图被完全刻画。

英文摘要:

For a graph $G$, the spectral radius $λ_{1}(G)$ of $G$ is the largest eigenvalue of its adjacency matrix. An odd wheel $W_{2k+1}$ with $k\geq2$ is a graph obtained from a cycle of order $2k$ by adding a new vertex connecting to all the vertices of the cycle. Let ${\rm SPEX}(n,W_{2k+1})$ be the set of $W_{2k+1}$-free graphs of order $n$ with the maximum spectral radius. Very recently, Cioabă, Desai and Tait \cite{CDT2} characterized the graphs in ${\rm SPEX}(n,W_{2k+1})$ for sufficiently large $n$, where $k\geq2$ and $k\neq4,5$. And they left the case $k=4,5$ as a problem. In this paper, we settle this problem. Moreover, we completely characterize the graphs in ${\rm SPEX}(n,W_{2k+1})$ when $k\geq4$ is even and $n\equiv2~(\mod4)$ is sufficiently large. Consequently, the graphs in ${\rm SPEX}(n,W_{2k+1})$ are characterized completely for any $k\geq2$ and sufficiently large $n$.

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

↑