Ask your own question, for FREE!
Mathematics 20 Online
OpenStudy (blockcolder):

Simple graph theory problem: If a graph has k vertices, all of which have degree at least (k-1)/2, then the graph is connected. Can't begin the proof by contradiction. Any hints?

OpenStudy (anonymous):

what is the condition for a graph to be connected

OpenStudy (kinggeorge):

The graph must also be simple.

OpenStudy (kinggeorge):

And then it's easily proved by induction.

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!