Share
Explore BrainMass

Prove Connectedness

Prove that G with at least
(n-1)(n-2)/2+1 edges is connected, where n is the order of G.

Solution Preview

Proof by contradiction.

If G has two components G1 and G2 and ...

Solution Summary

Connectedness of an expression is proven by contradiction.

$2.19