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

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

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

## 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...
- Discrete Mathematics - Consider the complete graph with 5 vertices, denoted by ...
- 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...
- heelp math - A graph is constructed iteratively according to the following ...
- MATHS - A simple graph G has 200000 edges and for any 3 vertices v,w,x, at least...
- Discrete Mathematics - If we consider the G as the whole of the cycle graph ...

More Related Questions