Kn is a complete graph of n vertices. That is, all possible edges between different vertices are present.
A reduction from the Clique problem to SIP is f (G,N) = (G,KN)
f is clearly computable in polynomial time. And it is evident that G has a clique of size N if and only if G has a subgraph that is isomorphic to KN.