Friday

December 19, 2014

December 19, 2014

Posted by **Joy** on Tuesday, August 6, 2013 at 8:00pm.

If the degrees of the vertices are 1, 2, 1, 3, 1, respectively, is G a tree? Why or why not?

- Discrete Mathematics -
**MathMate**, Thursday, August 8, 2013 at 9:52pmBy 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.

- Discrete Mathematics -
**Joy**, Friday, August 9, 2013 at 1:24pmMathMate: Thank you!

**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 ...

Discrete Mathematics - 3.Does it matter if we join two vertices with a straight ...

Math - Prove that a simple graph with n >_ 2 vertices must have atleast two ...