Explore BrainMass

N-connected graphs

Show that every n-connected graph has at least pn/2 edges.

Solution Preview

By a theorem Theorem 3.19 on page 75, Graphs and Digraphs, G. Chartrand and L. Lesniak, 3rd edition: For any graph G, the ...

Solution Summary

This is a proof regarding an n-connected graph.