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

图的谱半径与$[a,b]$-因子

Spectral radius and $[a,b]$-factors in graphs

Dandan Fan, Huiqiu Lin, Hongliang Lu

摘要:

图$G$的$[a,b]$-因子是生成子图$H$,使得对于每个$v\in V(G)$有$a\leq d_{H}(v)\leq b$。本文分别给出了最小度$δ$连通图存在奇$[1,b]$-因子和图存在$[a,b]$-因子的谱条件。我们的结果推广和改进了以前关于图的完美匹配的一些结果。对于$a=1$,我们推广了O \cite{S.O}的结果,得到了一个奇$[1,b]$-因子,并进一步改进了Liu,Liu和Feng \cite{W.L}关于$a=b=1$的结果.对于$n\geq 3a+b-1$,我们证实了Cho,Hyun,O和Park \cite{E.C}的猜想.最后总结了一些有待解决的问题。

英文摘要:

An $[a,b]$-factor of a graph $G$ is a spanning subgraph $H$ such that $a\leq d_{H}(v)\leq b$ for each $v\in V(G)$. In this paper, we provide spectral conditions for the existence of an odd $[1,b]$-factor in a connected graph with minimum degree $δ$ and the existence of an $[a,b]$-factor in a graph, respectively. Our results generalize and improve some previous results on perfect matchings of graphs. For $a=1$, we extend the result of O\cite{S.O} to obtain an odd $[1,b]$-factor and further improve the result of Liu, Liu and Feng\cite{W.L} for $a=b=1$. For $n\geq 3a+b-1$, we confirm the conjecture of Cho, Hyun, O and Park\cite{E.C}. We conclude some open problems in the end.

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

↑