图的哈密尔顿性的谱条件(英文)  

Spectral Conditions for Hamiltonicity of Graphs

作　　者：余桂东[1] 

机构地区：[1]安庆师范学院数学与计算科学学院,安徽安庆246011

出　　处：《应用数学》2014年第3期588-595,共8页Mathematica Applicata

基　　金：Supported by the National Natural Science Foundation of China(11071002);the NFS of Anhui Province(11040606M14);the NSF of Department of Education of Anhui Province(KJ2011A195);the Program for New Century Excellent Talents in University(NCET-10-0001);the Key Project of Chinese Ministry of Education(210091);the Specialized Research Fund for the Doctoral Program of Higher Education(20103401110002);the Scientific Research Fund for Fostering Distinguished Young Scholars of Anhui University(KJJQ1001)

摘　　要：本文,我们利用补图的邻接矩阵的谱半径给出原图含有哈密尔顿路,哈密尔顿圈,以及原图是哈密尔顿-连通图的一些谱条件.In this paper we establish some spectral conditions for a graph having Hamiltonian paths or Hamiltonian cycles,or being Hamilton-connected in terms of the spectral radius of the adjacency matrix of the complement of the graph.

关 键 词：图 谱半径 哈密尔顿路 哈密尔顿圈 哈密尔顿-连通图 

分 类 号：O157.5[理学—数学]