Hello there,

How would one show that a simple graph with n vertices and more than (n-1)(n-2)/2 edges must be connected?

I appreciate any help. Thanks!

Printable View

- February 3rd 2011, 04:45 AMmathpowerGraph Edges and Connectivity
Hello there,

How would one show that a simple graph with n vertices and more than (n-1)(n-2)/2 edges must be connected?

I appreciate any help. Thanks! - February 3rd 2011, 04:55 AMPlato
You should understand that this is not a homework service nor is it a tutorial service. Please either post some of your own work on this problem or explain what you do not understand about the question.