Generalization of Subgraph Isomorphism I am wondering how to prove that Subgraph Isomorphism is NP Complete.  Wikipedia indicates that the CLIQUE problem can be used to demonstrate this, but I can't figure out how. I also found this link that demonstrates how Subgraph Isomorphism reduces to CLIQUE, but I can't figure out how to reverse it.  Subgraph isomorphism reduction from the Clique problem

Here is a formal example of the problem from DASGUPTA 8.10: 
Given as input two undirected graphs G and H, determine whether G is a subgraph of H (that is, whether by deleting certain vertices and edges of H we obtain a graph that is, up to renaming of vertices, identical to G), and if so, return the corresponding mapping of V (G) into V (H).
A subgraph is isomorphic to a clique if, and only if, it is a clique.