Hey everyone,(adsbygoogle = window.adsbygoogle || []).push({});

I wasn't sure where to put this, since graph theory doesn't really have it's own name here (we don't even have a combinatorics or discrete math category...), so I decided to just put it here in "General Math". My question pertains to degree sequences of graphs.

I'm asked to show that s:7,6,5,4,4,3,2,1 is graphical. An algorithm for this is derived from a theorem in my book (Chartrand and Lesniak's book, 4th ed.). I can do this no problem.

But then I am asked to prove that there exists only one graph with this degree sequence, and I'm not sure how to do this. Basically, I have to show that the graph is nonisomorphic, I think.

This is for an independent study of graph theory, and any help would be greatly appreciated! :)

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Basic Graph Theory Question

**Physics Forums | Science Articles, Homework Help, Discussion**