某些图的性质的补的谱条件
Spectral conditions of complement for some graphical properties
摘要:
L.H. Feng et el \cite{feng4}给出了一个基于谱半径的图是$s$ -路可覆盖图和$s$ -Hamilton图的充分条件.受这一研究的启发,本文利用图的补图的谱半径给出了最小度大的图是$s$ -连通图、$s$ -边连通图、$s$-亏图、$s$ -路可覆盖图、$s$ -Hamilton图和$s$ -边-Hamilton图的充分条件.
英文摘要:
L.H. Feng at el \cite{feng4} present sufficient conditions based on spectral radius for a graph with large minimum degree to be $s$-path-coverable and $s$-Hamiltonian. Motivated by this study, in this paper, we give the sufficient conditions for a graph with large minimum degree to be $s$-connected, $s$-edge-connected, $β$-deficient, $s$-path-coverable, $s$-Hamiltonian and $s$-edge-Hamiltonian in terms of spectral radius of its complement.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。