We introduce the strong alliance polynomial of a graph. We obtain some properties of the strong alliance polynomial of a graph and its coefficients. In particular, we compute strong alliance polynomial for path, cycle, complete, start, complete bipartite and double star graphs; some of them verify unimodality.