Discrete 47.3
Not what you're looking for? Search our solutions OR ask your own Custom question.
3. Let d1,d2...dn be .... prove that d1...dn are degrees of the vertices. (See attachment for full question).
© BrainMass Inc. brainmass.com December 24, 2021, 5:07 pm ad1c9bdddfhttps://brainmass.com/math/discrete-math/discrete-29070
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 ...
Solution Summary
This solution is comprised of a detailed explanation to prove that d1...dn are degrees of the vertices.
$2.49