Suppose vertices are greater than or equal to 2 and the degree is greater than or equal to 1. Consider the sequence S1 which is non increasing. Further consider S2 (a second sequence) given by a non increasing order after the first n vertices the degree sequence goes down one and one vertex is removed at the end. Prove that S1 is graphical if and only if S2 is graphical.