Ask a New Question

Question

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? Why or why not?
12 years ago

Answers

MathMate
By definition, a tree is a connected acyaclic graph.

One of the sufficient properties of a tree is that the number of edges equals the number of vertices minus one.

Note: number of edges = (sum of degrees of all vertices)/2.
12 years ago
Joy
MathMate: Thank you!
12 years ago

Related Questions

Name the vertex of the graph of y=x^2 x-27 -120 Name the vertex of the graph y=x2−2x−120 𝑦 = 𝑥 2 − 2 𝑥 − 120 (1 point) Responses (1,−1... On a graph the vertex is (-3,-10) and the y intercept crosses at -1 The graph is opens upwards look... On a graph the vertex is (3,-1) the y crosses at 8 and x has points on the 2 and 4 it opens upward... What is the vertex of the graph of the function below? y=x2-4x+3 rY. ry. O (1,-1) 0 (2,01 0 (1... the vertex of the graph is (3, -9) the lesser zero is (0,0) the other zero is (6,0) the line of s... The vertex of the graph of y = 3(x-1)^2 + 2 is $ (-1,2) :: (1, -2) :: (3, 2) :: (1,2) What is the vertex of the graph of f(x) = |x + 5| – 6? (–6, –5) (–6, 5) (–5, –6) (5, –6)
Ask a New Question
Archives Contact Us Privacy Policy Terms of Use