Share
Explore BrainMass

Graphs : Connectedness and Cycles

13. Let G be a connected graph with (please see the attachment). Prove that G contains exactly one cycle.

Attachments

Solution Summary

A graph is proved to have at least one cycle. The solution is concise.

$2.19