Unified spectral hamiltonian results of balanced bipartite graphs and complementary graphs

2018/09/10 by Liu, Muhuo, Wu, Yang, Lai, Hong-Jian
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1809.03283

Abstract

There have been researches on sufficient spectral conditions for Hamiltonian properties and path-coverable properties of graphs. Utilizing the Bondy-Chvátal closure, we provide a unified approach to study sufficient graph eigenvalue conditions for these properties and sharpen former spectral results in [\em Linear Algebra Appl., 432 (2010), 566-570], [\em Linear Algebra Appl., 432 (2010), 2170-2173], [\em Appl. Mech. Mater., 336-338 (2013), 2329-2334], [\em Linear Algebra Appl., 467 (2015), 254-266], [\em Linear Multilinear Algebra, 64 (2016), 2252-2269], and [\em J. Comb. Optim., 35 (2018), 1104-1127], among others.

Related

• Spectral conditions of complement for some graphical properties
• Spectral radius and Hamiltonian properties of graphs, II
• Combinatorial spectra of graphs
• Spectral Radius and Hamiltonicity of graphs
• The Largest and Smallest Eigenvalues of Matrices and Some Hamiltonian Properties of Graphs