图的谱半径和Hamilton性 |
| |
引用本文: | 朱五华. 图的谱半径和Hamilton性[J]. 阜阳师范学院学报(自然科学版), 2011, 28(4): 22-23,34 |
| |
作者姓名: | 朱五华 |
| |
作者单位: | 安庆师范学院数学与计算科学学院,安徽安庆,246133 |
| |
摘 要: | 从图G的闭包理论角度去研究图的Hamilton性。利用图的补图谱半径的界,讨论了Hamilton图存在的谱条件,证明了n阶图G,如果它的补图的谱半径小于或等于(n-3)的算术平方根,则G是Hamilton图。
|
关 键 词: | Hamilton图 谱半径 闭包 Hamilton圈 |
Spectral radius and Hamiltonicity of a graph |
| |
Abstract: | The Hamiltonicity is studied from the closure theory of a graph G.We discuss some spectral conditions for the existence of Hamilton graph by using bounds of spectral radius of the Complement of a graph,and show that if G is a graph of order n with spectral radius of its complement is less than or equal to the arithmetic square root of n-3,then G is a Hamilton graph. |
| |
Keywords: | Hamihon graph spectral radius closure Hamilton cycle |
本文献已被 万方数据 等数据库收录! |