The realization graph G(d) of a degree sequence d is the whose vertices are labeled realizations d, where edges join that differ by swapping single pair edges. Barrus (2016) [3] characterized for which triangle-free. Here, any n≥4, we describe structure in exactly determines whether has clique size n. As consequence determine sequences complete on n vertices.