paper

Tight spectral conditions for the Hamiltonicity of -free split graphs

arXiv:2604.14763

Abstract

The Hamiltonicity and related subjects of split graphs, and in particular -free split graphs with received much attention. Dai et al. [Discrete Math. 345 (2022) 112826] conjectured that every -connected -free split graph is Hamiltonian. They proved the case when , and earlier Renjith and Sadagopan [Int. J. Found. Comput. Sci. 33 (2022) 1--32] proved the case when . Recently, Liu, Song, Zhang and Lai [Discrete Math. 346 (2023) 113402] proved that a split graph is Hamiltonian if and only if it is fully cycle extendable. So for every -connected -free split graph is fully cycle extendable. We give tight spectral sufficient conditions for a -free split graph to be Hamiltonian for .