References
- Karp RM. Reducibility among combinatorial problems. In: Complexity of computer computations. New York (NY): Plenum Press; 1972. pp. 85–103.
- Butler S, Chung F. Small spectral gap in the combinatorial Laplacian implies Hamiltonian. Ann Comb. 2010;13:403–412.
- Chva\’{t}al V. On Hamilton’s ideals. J Comb Theorem B. 1972;12:163–168.
- Fiedler M, Nikiforov V. Spectral radius and Hamiltonicity of graphs. Linear Algebra Appl. 2010;432:2170–2173.
- Gould RJ. Advances on the Hamiltonian problem-a survey. Graphs Combin. 2003;19:7–52.
- Gould RJ. Recent advances on the Hamiltonian problem: survey III. Graphs Combin. 2014;30:1–46.
- Krivelevich M, Sudakov B. Sparse pseudo-random graphs are Hamiltonian. J Graph Theory. 2003;42:17–33.
- Ning B, Ge J. Spectral radius and Hamiltonian properties of graphs. Linear Multilinear Algebra. 2015;63:1520–1530.
- Liu RF, Shiu WC, Xue J. Sufficient spectral conditions on Hamiltonian and traceable graphs. Linear Algebra Appl. 2015;467:254–266.
- Yu GD, Fan YZ. Spectral conditions for a graph to be Hamilton-connected. Appl Mech Mater. 2013;336–338:2329–2334.
- Zhou B. Signless Laplacian spectral radius and Hamiltonicity. Linear Algebra Appl. 2010;432:566–570.
- Moon J, Moser L. On Hamiltonian bipartite graphs. Israel J Math. 1963;1:163–165.
- Ferrara M, Jacobson M, Powell J. Characterizing degree-sum maximal nonhamiltonian bipartite graphs. Discrete Math. 2012;312:459–461.
- Zhou QN, Wang LG, Lu Y. Some sufficient conditions on Hamiltonian and traceable graphs. Adv Math (China). Forthcoming 2016.
- Xing RD, Zhou B, Li JP. On the distance signless Laplacian spectral radius of graphs. Linear Multilinear Algebra. 2014;62:1377–1387.
- Zhou QN, Wang LG. Some sufficient spectral conditions on Hamilton-connected and traceable graphs. Linear Multilinear Algebra. Forthcoming 2017;65:224–234.