Sufficient spectral conditions on Hamiltonian and traceable graphs
By Ruifang Liu, Wai Chee Shiu, Jie Xue. 2014
58 citations recorded by the source corpus.
Abstract In this paper, we give sufficient conditions on the spectral radius for a bipartite graph being Hamiltonian and traceable, which expand the results of Lu, Liu and Tian (2012) [10] . Furthermore, we also provide tight sufficient conditions on the signless Laplacian spectral radius for a graph to be Hamiltonian and traceable, which improve the results of Yu and Fan (2012) [11] .
Subfields: Computational Theory and Mathematics, Geometry and Topology, Mathematical Physics
View Paper: https://www.semanticscholar.org/paper/ea05009f78beade399a6b42ddd67991faf13b88f
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
In Geometry and Topology
In Mathematical Physics
Citations in the corpus
- Spectral radius and Hamiltonicity of graphs with large minimum degree (2016, result): “It should be noted that most of the results discussed in the present paper and in the references [1, 10, 13, 14, 15, 16, 17, 21] deal exclusively with very dense graphs, which makes these results somewhat one-sided.”
- The spanning k-trees, perfect matchings and spectral radius of graphs (2021, background): “Xueyi Huang http://orcid.org/0000-0003-0200-2096”
- A survey on spectral conditions for some extremal graph problems (2021, background): “This conjecture was recently confirmed by Wang, Kang and Xue [180].”
- Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles (2015, methodology): “There are some results related to this problem, see [7,8].”