yes , u r right ..

for 5 nodes , I m getting degree sequence as 4,3,2,2,1

& for 6 nodes , as 5,4,3,3,2,1

But , Can u prove that given n vertices , we will always be able to form a simple,undirected, connected graph with n-1 distinct degrees ?

for 5 nodes , I m getting degree sequence as 4,3,2,2,1

& for 6 nodes , as 5,4,3,3,2,1

But , Can u prove that given n vertices , we will always be able to form a simple,undirected, connected graph with n-1 distinct degrees ?