Find all the non-isomorphic graphs whose degree sequence is (6,3,3,3,3,3,3) I don't even know where to start, can someone please help?

Question

anonymous · Answer

@LagrangeSon678 @amistre64 @JamesJ

anonymous · Answer

Why are graph theory tutorials so hard to find?

anonymous · Answer

@TuringTest

anonymous · Answer

@Zarkon

amistre64 · Answer

anonymous · Answer

Thank you! I'll take a look.

amistre64 · Answer

other than that i almost have an idea of what it talking about

anonymous · Answer

i have no clue what this is talking about.. like i tried drawing this:
|dw:1332889875117:dw|

amistre64 · Answer

that looks like it fits the sequence, from what little i can tell about what a sequence is spose to be

anonymous · Answer

yea like that vertex in the middle has degree 6, and everyone else has degree 3. And there are 7 vertices in total.

amistre64 · Answer

is it noniso...thingy?

anonymous · Answer

that's what i have no idea about. How can I find all non isomorphic. I don't get it..

anonymous · Answer

basically non isomorphic would mean.. if a is connected to b on one graph, it can't be connected to b in another graph.

amistre64 · Answer

i cant make hide nor hair of this stuff ....

anonymous · Answer

lol whatever I'll look around, try to find something.

anonymous · Answer

Thanks a lot anyway.

amistre64 · Answer

good luck :)