Discrete Mathematics
posted by Joy .
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?
Respond to this Question
Similar Questions

Math
Prove that a simple graph with n >_ 2 vertices must have atleast two vertices with the same degree. There was a hint given in the book saying that the key to this is the graph can not have both a vertex of 0 degree and a vertex … 
Math
Prove that a simple graph with n >_ 2 vertices must have atleast two vertices with the same degree. There was a hint given in the book saying that the key to this is the graph can not have both a vertex of 0 degree and a vertex … 
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 … 
Discrete Mathematics
Consider the complete graph with 5 vertices, denoted by K5. A. Draw the graph. B. How many edges are in K5? 
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. 
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? 
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, 3, 4, 6, respectively, how many edges are in G? 
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? 
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? 
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.