Posted by **Joy** on Tuesday, August 6, 2013 at 8:00pm.

Let G be a graph with vertex set V = { v1, v2, v3, v4, v5}.

If the degrees of the vertices are 1, 2, 1, 3, 1, respectively, is G a tree? Why or why not?

## Answer This Question

## Related Questions

- Discrete Mathematics - Let G be a graph with vertex set V = {v1, v2, v3, v4, v5...
- Discrete Mathematics - Let G be a graph with vertex set V = {v1, v2, v3, v4, v5...
- Discrete Mathematics - Let G be a graph with vertex set V = { v1, v2, v3, v4, v5...
- Discrete Mathematics - Let G be a graph with the vertex set V = {v1, v2, v3, v4...
- heelp math - A graph is constructed iteratively according to the following ...
- Discrete math - please help I'm completely lost Is the following connected graph...
- Discrete Mathematics - Using Fleury's Algorithm in the graph to the bottom left...
- Discrete Mathematics - Using Fleury's Algorithm in the graph to the bottom left...
- Discrete Mathematics - Consider the complete graph with 5 vertices, denoted by ...
- Math - Prove that a simple graph with n >_ 2 vertices must have atleast two ...

More Related Questions