arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2502.00405math.COcs.DM
收藏

图因子的谱充分条件

Spectral Sufficient Conditions for Graph Factors

Fengyun Ren, Shumin Zhang, Ke Wang

AI总结:

本文通过图谱方法,建立了无符号拉普拉斯谱半径和距离谱半径的界,作为判定图包含$\{K_2\}$-因子及$\{K_{1,1}, K_{1,2},C_m: m\geq3\}$-因子的充分条件,并通过构造极图证明了这些界是最佳的。

摘要:

图的$\{K_{1,1}, K_{1,2},C_m: m\geq3\}$-因子是一个生成子图,其每个连通分支都是$\{K_{1,1}, K_{1,2},C_m: m\geq3\}$中的一个元素。本文通过图谱方法,建立了无符号拉普拉斯谱半径的下界和距离谱半径的上界,以判定一个图是否包含$\{K_2\}$-因子。我们得到了图$G$的边数(相应地,谱半径)的下界,以保证$G$包含$\{K_{1,1}, K_{1,2},C_m: m\geq3\}$-因子。接着,我们确定了图$G$距离谱半径的上界,以确保$G$具有$\{K_{1,1}, K_{1,2},C_m: m\geq3\}$-因子。此外,通过构造极图,我们证明了上述所有界都是最佳的。

英文摘要:

The $\{K_{1,1}, K_{1,2},C_m: m\geq3\}$-factor of a graph is a spanning subgraph whose each component is an element of $\{K_{1,1}, K_{1,2},C_m: m\geq3\}$. In this paper, through the graph spectral methods, we establish the lower bound of the signless Laplacian spectral radius and the upper bound of the distance spectral radius to determine whether a graph admits a $\{K_2\}$-factor. We get a lower bound on the size (resp. the spectral radius) of $G$ to guarantee that $G$ contains a $\{K_{1,1}, K_{1,2},C_m: m\geq3\}$-factor. Then we determine an upper bound on the distance spectral radius of $G$ to ensure that $G$ has a $\{K_{1,1}, K_{1,2},C_m: m\geq3\}$-factor. Furthermore, by constructing extremal graphs, we show that the above all bounds are best possible.

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

↑