MathCastle
Graph TheoryEasyGraphs and Degrees

Graphs and Degrees · Easy problem

Apply ONE step of the Havel–Hakimi test to the degree sequence (4,3,3,2,2,1,1)(4,3,3,2,2,1,1): delete the largest term (44) and subtract 11 from each of the next 44 largest terms. What is the sum of the resulting 66-term sequence?