Posted by **Joy** on Saturday, August 3, 2013 at 11:47am.

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

A. Is it possible for the degrees of the vertices to be 3, 6, 2, 1, 5, respectively? Why or why not?

B. If the degrees of the vertices are 1, 2, 3, 4, 6, respectively, how many edges are in G?

C. If the degrees of the vertices are 5, 1, 0, 6, 2, respectively, does G have an Eulerian path? Why or why not?

D. 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 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 ...
- Discrete Mathematics - 3.Does it matter if we join two vertices with a straight ...
- Math - Prove that a simple graph with n >_ 2 vertices must have atleast two ...

More Related Questions