Spectral conditions for the existence of specified paths and cycles in graphs

Let G be a graph with n   vertices and λn(G)λn(G) be the least eigenvalue of its adjacency matrix of G. In this paper, we give sharp bounds on the least eigenvalue of graphs without given paths or cycles and determine the extremal graphs. This result gives spectral conditions for the existence of specified paths and cycles in graphs.