Some sufficient spectral conditions on Hamilton-connected and traceable graphs
Some sufficient spectral conditions on Hamilton-connected and traceable graphs
复制标题
DOI：
10.1080/03081087.2016.1182463
复制
发表时间：
2017-02
影响因子：
1.1
通讯作者：
Qiannan Zhou;Ligong Wang
中科院分区：
文献类型：
--
作者：
Qiannan Zhou;Ligong Wang
在本文中，我们从图的边数、谱半径和无符号拉普拉斯谱半径方面建立了图哈密顿连通的充分条件。此外，我们还给出了图从每个顶点可追踪的一些充分条件，包括边数、谱半径和无符号拉普拉斯谱半径。
In this paper, we establish some sufficient conditions for a graph to be Hamilton-connected in terms of the edge number, the spectral radius and the signless Laplacian spectral radius of the graph. Furthermore, we also give some sufficient conditions for a graph to be traceable from every vertex in terms of the edge number, the spectral radius and the signless Laplacian spectral radius.