Abstract: A non-increasing sequence π=(d₁,…,d_n)of nonnegative integers is a graph sequence if it is realizable by a simple graph G on n vertices. In this case, G is referred to as a realization of π. Given a graph H, if π has a realization containing H as a subgraph, a graphic sequence π is potentially H- graphic. When 2≤n≤5, t≥2 , the exact value for r_pot(P_n, K_t)will be determined completely.