Some Results on the Majorization Theorem of Connected Graphs

Let π = （d1, d2,..., dn） and π＇ = （d＇1, d＇2,..., d＇n） be two non-increasing degree sequences.