Ask your own question, for FREE!
Mathematics 15 Online
OpenStudy (anonymous):

Prove that for any graph G of order at least 2, the degree sequence has at least one pair of repeated entries.

OpenStudy (kinggeorge):

Does the graph have to be connected? Otherwise |dw:1337305527681:dw|is a counterexample.

OpenStudy (kinggeorge):

Even if it's connected, |dw:1337305673279:dw|Is also a counterexample.

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!