threshold graph and degree sequence proof

$\textbf{Definition:}$ $G$ is a threshold graph if and only if $G$ can be constructed from the one-vertex graph by repeatedly adding an isolated vertex or a dominating vertex.

I am trying to prove the following problem:

Let $d$ = $\{d_1 \geq \cdots \geq d_n \}$ be a degree sequence and define, $r_i = \max\{j : d_j \geq i\}$ and $f = \max\{j : d_j \geq j\}$. Prove that $d$ is a degree sequence of a threshold graph if and only if $r_i = d_i + 1$ for $i=1,\ldots,f$.

I think the overall idea would be to show that if $r_i$ is as claimed, then $d$ must be a degree sequence of a threshold graph because the pattern represents the recursive construction of a threshold graph. And then prove the converse.

I would appreciate some help. Thank you.

• I guess you should change defenition of $f$ to this one: $f = \max(\{\,0\,\} \cup \{\,j \mid d_j \ge j\,\}$ to have correctly defined $f$ for an empty graph (i. e. when all vertex degrees are zero). Also $r_i$ should be defined for $i = 1, \ldots, f$ only. – Smylic May 6 '18 at 20:14

• The vertex with degree $d_1$ is a dominating vertex, or
• The vertex with degree $d_n$ is an isolated vertex.