2000 character limit reached
Spectral radius and the 2-power of Hamilton paths
Published 8 Mar 2024 in math.CO | (2403.05040v1)
Abstract: We determine the maximum number of a graph without containing the 2-power of a Hamilton path. Using this result, we establish a spectral condition for a graph containing the 2-power of a Hamilton path.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.