Share
Explore BrainMass

Graphs : Connectedness, Vertices and Edges

11. Let G be a graph with n>= 2 vertices.
a) Prove that if G has at least (n-1) + 1 edges the G is connected.
( 2 )

b) Show that the result in (a) is best possible; that is, for each n>= 2, prove there is a graph with (n- 1)
( 2 )
edges that is not connected.

Attachments

Solution Summary

Connectedness, Vertices and Edges are investigated. The solution is detiled and well presented.

$2.19