In this paper, we define the concept of generalized Fibonacci polynomial of a graph \(G\) which gives the total number of all \(k\)-stable sets in generalized lexicographical products of graphs. This concept generalizes the Fibonacci polynomial of a graph introduced by G. Hopkins and W. Staton in [3].