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].
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
