Share
Explore BrainMass

Trees: Vertex; Cycle

Let G be a graph in which every vertex has degree 2. Is G necessarily a cycle?

*Please see attachment for additional information. Thanks.

Use words to describe solution process.

Use math symbol editor like LateX, please no stuff like <=.

Attachments

Solution Summary

This solution is comprised of a detailed explanation to answer if G is necessarily a cycle.

$2.19