Post a New Question

Discrete Mathematics

posted by .

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?

  • Discrete Mathematics -

    The number of edges
    =(sum of degrees of all vertices)/2

  • Discrete Mathematics -

    MathMate: Is this correct for the following problem:

    1 + 2 + 3 + 4 + 6 = 16

    2E = 16

    E = 8

    Does the graph have 8 edges?

Respond to this Question

First Name
School Subject
Your Answer

Similar Questions

  1. MATHS

    A simple graph G has 200000 edges and for any 3 vertices v,w,x, at least one of the edges vw,wx,xv is not present in G. What is the least number of vertices that G can have?
  2. heelp math

    A graph is constructed iteratively according to the following algorithm. The graph starts as a single vertex. With probability p, the graph stops here. Otherwise, 3 new vertices are constructed and joined to this vertex. If we have …
  3. Discrete Mathematics

    Consider the complete graph with 5 vertices, denoted by K5. A. Draw the graph. B. How many edges are in K5?
  4. Discrete Mathematics

    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?
  5. Discrete Mathematics

    Using Fleury's Algorithm in the graph to the bottom left, I deleted three edges and I got the graph to the bottom right. If I am currently at the starred vertex, list all possibilities for the edge I should travel next.
  6. Discrete Mathematics

    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?
  7. Discrete Mathematics

    Let G be a graph with the vertex set V = {v1, v2, v3, v4, v5}. If the degrees of the vertices are 5, 1, 0, 6, 2, respectively, does G have an Eulerian path?
  8. Discrete Mathematics

    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?
  9. Discrete Mathematics

    Using Fleury's Algorithm in the graph to the bottom left, I deleted three edges and I got the graph to the bottom right. If I am currently at the starred vertex, list all possibilities for the edge I should travel next.
  10. Discrete Mathematics

    If we consider the G as the whole of the cycle graph having 4 edges then is G a complete graph?

More Similar Questions

Post a New Question