arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2110.09404math.CO
收藏

图由其广义谱确定的一个改进条件

An improved condition for a graph to be determined by its generalized spectrum

Wei Wang, Wei Wang, Fuhai Zhu

AI总结:

本文针对图的广义谱唯一确定问题,引入与素数相关且在广义共谱下不变的新多项式,给出 $d_n$ 无平方因子图族为 DGS 的更宽泛充分条件。

摘要:

谱图理论中一个基本且具有挑战性的问题,是刻画哪些图能够由其谱唯一确定。在 Wang 的论文 [J. Combin. Theory, Ser. B, 122 (2017): 438-451] 中,作者证明了当 $2^{-\lfloor\frac{n}{2}\rfloor}\det W$ 为奇数且无平方因子时,一个具有 $n$ 个顶点的图 $G$ 由其广义谱唯一确定(DGS)。这里,$W$ 是 $G$ 的游走矩阵,即 $W=[e,Ae,\ldots,A^{n-1}e]$,其中 $e$ 是全一向量,$A$ 是 $G$ 的邻接矩阵。本文关注一个更大的图族,其 $d_n$ 无平方因子,其中 $d_n$ 指 $W$ 的最后一个不变因子。我们为图 $G$ 引入了一类与素数 $p$ 相关的新多项式。这种多项式在广义共谱关系下保持不变。利用这些新定义的多项式,我们得到了该更大图族中的图为 DGS 的一个充分条件。本文的主要结果改进了上述 Wang 的结果,同时主要结果的证明为攻克图的广义谱刻画问题提供了一条新途径。

英文摘要:

A fundamental and challenging problem in spectral graph theory is to characterize which graphs are uniquely determined by their spectra. In Wang [J. Combin. Theory, Ser. B, 122 (2017): 438-451], the author proved that an $n$-vertex graph $G$ is uniquely determined by its generalized spectrum (DGS) whenever $2^{-\lfloor\frac{n}{2}\rfloor}\det W$ is odd and square-free. Here, $W$ is the walk matrix of $G$, namely, $W=[e,Ae,\ldots,A^{n-1}e]$ with $e$ all-one vector and $A$ the adjacency matrix of $G$. In this paper, we focus on a larger family of graphs with $d_n$ square-free, where $d_n$ refers to the last invariant factor of $W$. We introduce a new kind of polynomials for a graph $G$ associated with a prime $p$. Such a polynomial is invariant under generalized cospectrality. Using the newly defined polynomials, we obtain a sufficient condition for a graph in the larger family to be DGS. The main result of this paper improves upon the aforementioned result of Wang while the proof for the main result gives a new way to attack the problem of generalized spectral characterization of graphs.

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

↑