Spectral radius and Hamiltonian graphs

By Mei Lu, Huiqing Liu, F. Tian. 2012

64 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/883230e7f5fff0c2caecc9a5e0a5305d041a701f

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

1. Bo Ning
2. Binlong Li
3. Yongtao Li
4. Lihua Feng
5. Weijun Liu
6. Vladimir Nikiforov
7. Jie Xue
8. Jun Ge

In Geometry and Topology

1. Vladimir Nikiforov
2. Bo Ning
3. Yongtao Li
4. Lihua Feng
5. Weijun Liu
6. Binlong Li
7. Jie Xue
8. Jun Ge

Citations in the corpus

• Sufficient spectral conditions on Hamiltonian and traceable graphs (2014, methodology): “1 ( [10]) Let G[X, Y ] be a bipartite graph and G the quasi-complement of G, where |X| = |Y | = n ≥ 2.”
• 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.”
• Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles (2015, background): “There are some results related to this problem, see [7,8].”
• A survey on spectral conditions for some extremal graph problems (2021, background): “Theorem 3.7 (Lu–Liu–Tian [139]).”
• Spectral radius and Hamiltonian properties of graphs (2013, background): “[3]) Let G be a connected graph on n ≥ 7 vertices.”