Posted by **Joy** on Tuesday, August 6, 2013 at 7:55pm.

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

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

- Discrete Mathematics -
**MathMate**, Thursday, August 8, 2013 at 9:59pm
See your next post to find out how to calculate the number of edges.

Hence deduce if such a graph can exist or not.

- Discrete Mathematics -
**Joy**, Friday, August 9, 2013 at 1:45pm
MathMate: Is this correct for the following problem?

3 + 6 + 2 + 1 + 5

2E = 17

E = 8.5

If your allowed to have a decimal as an answer, then to come up with the answer for the amount of edges then yes it is possible for the degrees of the vertices to be 3, 6, 2, 1, 5. If your not allowed to have a decimal as an answer for the amount of edges, then no its not possible for the degrees of the vertices to be 3, 6, 2, 1, 5.

## 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 ...
- Math - Prove that a simple graph with n >_ 2 vertices must have atleast two ...
- Math - Prove that a simple graph with n >_ 2 vertices must have atleast two ...

More Related Questions