The spectral radius and k-power of Hamilton cycle of graphs

Abstract

For a graph G and an integer k≥2, the k-power of G is the graph with vertex set V(G) in which two vertices are adjacent if and only if their distance is at most k in G. In this paper, we study spectral conditions for a graph to contain a copy of k-power of Hamilton cycle. This solves a problem proposed in [20].