Spectral Condition for a Graph to be Hamiltonian with respect to Normalized Laplacian
暂无分享,去创建一个
[1] L. Pósa,et al. Hamiltonian circuits in random graphs , 1976, Discret. Math..
[2] Vladimir Nikiforov,et al. Spectral radius and Hamiltonicity of graphs , 2009, 0903.5353.
[3] I. Palásti,et al. On Hamilton-cycles of random graphs , 1971 .
[4] F. Chung. Discrete isoperimetric inequalities , 1996 .
[5] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.
[6] Benny Sudakov,et al. Sparse pseudo-random graphs are Hamiltonian , 2003, J. Graph Theory.
[7] Steve Butler,et al. Small Spectral Gap in the Combinatorial Laplacian Implies Hamiltonian , 2010 .
[8] Bo Zhou,et al. Signless Laplacian spectral radius and Hamiltonicity , 2010 .
[9] Sufficient Spectral Conditions for Hamiltonicity , 2011 .
[10] Yi-Zheng Fan,et al. Spectral Conditions for a Graph to be Hamilton-Connected , 2012, 1207.6447.
[11] Ioan Tomescu,et al. On Hamiltonian-connected regular graphs , 1983, J. Graph Theory.