# Discrete 47.3

Not what you're looking for?

3. Let d1,d2...dn be .... prove that d1...dn are degrees of the vertices. (See attachment for full question).

##### Purchase this Solution

##### Solution Summary

This solution is comprised of a detailed explanation to prove that d1...dn are degrees of the vertices.

##### Solution Preview

(See the attached file for the full solution).

Proof :

First, we want to show the easy part:

If are the degrees of the vertices of a tree on n nodes .

In fact, by definition, the number of edges of a tree with n nodes is n-1, and the sum of degrees of n nodes are twice the number of edges in a graph, therefore . ( This is because when counting degrees, we double count every edge, since every edge connects ...

##### Purchase this Solution

##### Free BrainMass Quizzes

##### Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

##### Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

##### Probability Quiz

Some questions on probability

##### Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

##### Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.